ASIACRYPT
2000
Springer
13 years 8 months ago
2000
Springer
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
ASIACRYPT
2000
Springer
13 years 8 months ago
2000
Springer
In this paper we introduce a structure iterated by the rule A of Skipjack and show that this structure is provably resistant against differential or linear attacks. It is the main ...
ASIACRYPT
2000
Springer
13 years 8 months ago
2000
Springer
ASIACRYPT
2000
Springer
13 years 8 months ago
2000
Springer
ASIACRYPT
2000
Springer
13 years 8 months ago
2000
Springer
This paper takes a closer look at Rivest's chaffing-and-winnowing paradigm for data privacy. We begin with a definition which enables one to clearly determine whether a given ...
ASIACRYPT
2000
Springer
13 years 8 months ago
2000
Springer
ASIACRYPT
2000
Springer
13 years 8 months ago
2000
Springer
In 1980 Hellman introduced a general technique for breaking arbitrary block ciphers with N possible keys in time T and memory M related by the tradeoff curve TM2 = N2 for 1 T N. ...
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
We consider a problem which was stated in a request for comments made by NIST in the FIPS97 document. The question is the following: Can we have a digital signature public key infr...
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
We give the first proof of security for the full Unix password hashing algorithm (rather than of a simplified variant). Our results show that it is very good at extracting almost...
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer