163
click to vote
CRYPTO
15 years 6 months ago
2003 Springer 
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
119
click to vote
CRYPTO
15 years 6 months ago
2003 Springer
We describe a block-cipher mode of operation, CMC, that turns an n-bit block cipher into a tweakable enciphering scheme that acts on strings of mn bits, where m ≥ 2. When the und...
126
click to vote
CRYPTO
15 years 6 months ago
2003 Springer 
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
102
click to vote
CRYPTO
15 years 6 months ago
2003 Springer 
Abstract. In 1998, Boneh, Durfee and Frankel [4] presented several attacks on RSA when an adversary knows a fraction of the secret key bits. The motivation for these so-called part...
110
click to vote
CRYPTO
15 years 6 months ago
2003 Springer
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
|
Cryptology