Sciweavers

8 search results - page 2 / 2
» sacrypt 1999
Sort
View
SACRYPT
1999
Springer
13 years 9 months ago
Elliptic Curve Pseudorandom Sequence Generators
In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF 2m. We call these sequences elliptic curve...
Guang Gong, Thomas A. Berson, Douglas R. Stinson
SACRYPT
1998
Springer
111views Cryptology» more  SACRYPT 1998»
13 years 9 months ago
Storage-Efficient Finite Field Basis Conversion
Abstract. This contribution proposes text for possible inclusion in IEEE P1363a specifying storageefficient finite field basis conversion techniques. Like IEEE P1363a, it is writte...
Burton S. Kaliski Jr., Yiqun Lisa Yin
SACRYPT
1999
Springer
13 years 9 months ago
Key-Schedule Cryptanalysis of DEAL
DEAL is a six- or eight-round Luby-Rackoff cipher that uses DES as its round function, with allowed key lengths of 128, 192, and 256 bits. In this paper, we discuss two new result...
John Kelsey, Bruce Schneier