140
click to vote
CRYPTO
15 years 4 months ago
1995 Springer 
We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x, cast each of its words into a small numb...
110
Voted
CRYPTO
15 years 4 months ago
1995 Springer 
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
97
Voted
CRYPTO
15 years 4 months ago
1995 Springer 
The Diffie-Hellman key exchange algorithm can be implemented using the group of points on an elliptic curve over the field F2n. A software version of this using n = 155 can be o...
89
Voted
CRYPTO
15 years 4 months ago
1995 Springer 85
Voted
CRYPTO
15 years 4 months ago
1995 Springer
We review the well-known relation between Lucas sequences and exponentiation. This leads to the observation that certain public-key cryptosystems that are based on the use of Lucas...
|
Cryptology