52
Voted
DCC
2006
IEEE
16 years 3 days ago
2006
IEEE
DCC
2006
IEEE
16 years 3 days ago
2006
IEEE
90
Voted
DCC
2006
IEEE
16 years 3 days ago
2006
IEEE
In their seminal paper, Miyaji, Nakabayashi and Takano [12] describe a simple method for the creation of elliptic curves of prime order with embedding degree 3, 4, or 6. Such curve...
DCC
2006
IEEE
16 years 3 days ago
2006
IEEE
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
DCC
2006
IEEE
16 years 3 days ago
2006
IEEE
We present a new characterization of semi-bent and bent quadratic functions on finite fields. First, we determine when a GF(2)-linear combination of Gold functions Tr(x2i +1 ) is ...
84
Voted
DCC
2006
IEEE
16 years 3 days ago
2006
IEEE
We describe a simple and novel cryptographic construction that we refer to as a fuzzy vault. A player Alice may place a secret value in a fuzzy vault and "lock" it using ...
82
Voted
DCC
2006
IEEE
16 years 3 days ago
2006
IEEE
DCC
2006
IEEE
16 years 3 days ago
2006
IEEE
At Crypto '85, Desmedt and Odlyzko described a chosen-ciphertext attack against plain RSA encryption. The technique can also be applied to RSA signatures and enables an existe...
54
Voted
DCC
2006
IEEE
16 years 3 days ago
2006
IEEE
50
Voted
DCC
2006
IEEE
16 years 3 days ago
2006
IEEE
Abstract. An (n, k)q-MDS code C over an alphabet A (of size q) is a collection of qk n-tuples over A such that no two words of C agree in as many as