ASIACRYPT
2000
Springer
14 years 29 days ago
2000
Springer
At Asiacrypt ’99, Sun, Yang and Laih proposed three RSA variants with short secret exponent that resisted all known attacks, including the recent Boneh-Durfee attack from Eurocry...
ASIACRYPT
2000
Springer
14 years 29 days ago
2000
Springer
Abstract. We investigate several alternate characterizations of pseudorandom functions (PRFs) and pseudorandom permutations (PRPs) in a concrete security setting. By analyzing the ...
ASIACRYPT
2000
Springer
14 years 29 days ago
2000
Springer
ASIACRYPT
2000
Springer
14 years 29 days ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
ASIACRYPT
2000
Springer
14 years 29 days ago
2000
Springer
An authenticated encryption scheme is a symmetric encryption scheme whose goal is to provide both privacy and integrity. We consider two possible notions of authenticity for such ...
ASIACRYPT
2000
Springer
14 years 29 days ago
2000
Springer
The paper shows that some of elliptic curves over finite fields of characteristic three of composite degree are attacked by a more effective algorithm than Pollard’s ρ method...
ASIACRYPT
2000
Springer
14 years 29 days ago
2000
Springer
Since Power Analysis on smart-cards was introduced by Paul Kocher [KJJ98], the validity of the model used for smart-cards has not been given much attention. In this paper, we firs...
ASIACRYPT
2000
Springer
14 years 29 days ago
2000
Springer
nded abstract of this work appears Advances in Cryptology — Asiacrypt 2000, Tatsuaki Okamoto, editor, Lecture Notes in Computer Science vol. 1976, Springer-Verlag, 2000. c IACR A...
ASIACRYPT
2000
Springer
14 years 29 days ago
2000
Springer
Rather than use a shared key directly to cryptographically process (e.g. encrypt or authenticate) data one can use it as a master key to derive subkeys, and use the subkeys for the...
ASIACRYPT
2000
Springer
14 years 29 days ago
2000
Springer
A common practice for signing with RSA is to first apply a hash function or a redundancy function to the message, add some padding and exponentiate the resulting padded message us...