22 search results - page 3 / 5 » aaecc 2007 |
AAECC
2007
Springer
14 years 4 months ago
2007
Springer
The uniform distribution of the trace map lends itself very well to the construction of binary and non-binary codes from Galois fields and Galois rings. In this paper we study the...
AAECC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Here we study a weakness of the RC4 Key Scheduling Algorithm (KSA) that has already been noted by Mantin and Mironov. Consider the RC4 permutation S of N (usually 256) by...
AAECC
2007
Springer
13 years 10 months ago
2007
Springer
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
AAECC
2007
Springer
13 years 10 months ago
2007
Springer
We study genus g hyperelliptic curves with reduced automorphism group A5 and give equations y2 = f(x) for such curves in both cases where f(x) is a decomposable polynomial in x2 or...
AAECC
2007
Springer
13 years 10 months ago
2007
Springer
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...