CRYPTO
1993
Springer
14 years 3 months ago
1993
Springer
Abstract. There are numerous subexponential algorithms for computing discrete logarithms over certain classes of finite fields. However, there appears to be no published subexponen...
IMA
1997
Springer
14 years 3 months ago
1997
Springer
This paper reviews constructions of hash functions and MAC algorithms based on block ciphers. It discusses the main requirements for these cryptographic primitives, motivates these...
IMA
1997
Springer
14 years 3 months ago
1997
Springer
We show how it is possible for two parties to co-operate in generating the parameters for an RSA encryption system in such a way that neither individually has the ability to decry...
IMA
1997
Springer
14 years 3 months ago
1997
Springer
This paper proposes new protocols for two goals: authenticated key agreement and authenticated key agreement with key con rmation in the asymmetric public-key setting. A formalm...
FSE
1997
Springer
14 years 3 months ago
1997
Springer
Most encryption algorithms are designed without regard to their performance on top-of-the-line microprocessors. This paper discusses general optimization principles algorithms desi...
FSE
1997
Springer
14 years 3 months ago
1997
Springer
FSE
1997
Springer
14 years 3 months ago
1997
Springer
This paper presents several methods to construct trapdoor block ciphers. A trapdoor cipher contains some hidden structure; knowledge of this structure allows an attacker to obtain ...
FSE
1997
Springer
14 years 3 months ago
1997
Springer
We propose secret-key cryptosystems MISTY1 and MISTY2, which are block ciphers with a 128-bit key, a 64-bit block and a variable number of rounds. MISTY is a generic name for MISTY...
FSE
1997
Springer
14 years 3 months ago
1997
Springer
Abstract. This paper presents xmx, a new symmetric block cipher optimized for public-key libraries and microcontrollers with arithmetic coprocessors. xmx has no S-boxes and uses on...
FSE
1997
Springer
14 years 3 months ago
1997
Springer
Feistel ciphers are very common and very important in the design and analysis of blockciphers, especially due to four reasons: (1) Many (DES-like) ciphers are based on Feistel’s ...