Sciweavers

SACRYPT
1999
Springer
13 years 8 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
1999
Springer
13 years 8 months ago
Pseudonym Systems
Anna Lysyanskaya, Ronald L. Rivest, Amit Sahai, St...
SACRYPT
1999
Springer
13 years 8 months ago
Yarrow-160: Notes on the Design and Analysis of the Yarrow Cryptographic Pseudorandom Number Generator
We describe the design of Yarrow, a family of cryptographic pseudo-random number generators (PRNG). We describe the concept of a PRNG as a separate cryptographic primitive, and the...
John Kelsey, Bruce Schneier, Niels Ferguson
SACRYPT
1999
Springer
13 years 8 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
SACRYPT
1999
Springer
13 years 8 months ago
Modeling Linear Characteristics of Substitution-Permutation Networks
Liam Keliher, Henk Meijer, Stafford E. Tavares
SACRYPT
1999
Springer
119views Cryptology» more  SACRYPT 1999»
13 years 8 months ago
A Universal Encryption Standard
Abstract. DES and triple-DES are two well-known and popular encryption algorithms, but they both have the same drawback: their block size is limited to 64 bits. While the cryptogra...
Helena Handschuh, Serge Vaudenay