DCC
2001
IEEE
14 years 11 months ago
2001
IEEE
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...
DCC
2001
IEEE
14 years 11 months ago
2001
IEEE
The automorphism group of the Barnes-Wall lattice Lm in dimension 2m (m = 3) is a subgroup of index 2 in a certain "Clifford group" Cm of structure 21+2m + .O+ (2m, 2). ...
DCC
2001
IEEE
14 years 11 months ago
2001
IEEE
We prove that elements of the Weierstrass gap set of a pair of points may be used to define a geometric Goppa code which has minimum distance greater than the usual lower bound. We...
DCC
2001
IEEE
14 years 11 months ago
2001
IEEE
DCC
2001
IEEE
14 years 11 months ago
2001
IEEE
In this paper, a Legendre sequence of period p for any odd prime p is explicitely represented as a sum of trace functions from GF(2n) to GF(2), where n is the order of 2 mod p.
DCC
2001
IEEE
14 years 11 months ago
2001
IEEE
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
DCC
2001
IEEE
14 years 11 months ago
2001
IEEE
The multicovering radii of a code are recent generalizations of the covering radius of a code. For positive m, the m-covering radius of C is the least radius t such that every m-tu...
DCC
2001
IEEE
14 years 11 months ago
2001
IEEE
We construct large caps in projective spaces of small dimension (up to 11) defined over fields of order at most 9. The constructions are both theoretical and computer-supported. S...
DCC
2001
IEEE
14 years 11 months ago
2001
IEEE
DCC
2001
IEEE
14 years 11 months ago
2001
IEEE
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...