FSE
1997
Springer
13 years 8 months ago
1997
Springer
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
FSE
1997
Springer
13 years 8 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
13 years 8 months ago
1997
Springer
FSE
1997
Springer
13 years 8 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
13 years 8 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
13 years 8 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
13 years 8 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 ...
FSE
1997
Springer
13 years 8 months ago
1997
Springer
FSE
1997
Springer
13 years 8 months ago
1997
Springer
In this paper we present a new 128-bit block cipher called Square. The original design of Square concentrates on the resistance against di erential and linear cryptanalysis. Howeve...
FSE
1997
Springer
13 years 8 months ago
1997
Springer
