Sciweavers

2967 search results - page 236 / 594
» Cryptology
Sort
View
SACRYPT
2001
Springer
136views Cryptology» more  SACRYPT 2001»
15 years 11 months ago
New (Two-Track-)MAC Based on the Two Trails of RIPEMD
We present a new message authentication code. It is based on a two trail construction, which underlies the unkeyed hash function RIPEMD-160. It is in comparison with the MDx-MAC ba...
Bert den Boer, Bart Van Rompay, Bart Preneel, Joos...
SACRYPT
2001
Springer
126views Cryptology» more  SACRYPT 2001»
15 years 11 months ago
Analysis of the E0 Encryption System
The encryption system E0, which is the encryption system used in the Bluetooth specification, is examined. In the current paper, a method of deriving the cipher key from a set of ...
Scott R. Fluhrer, Stefan Lucks
SACRYPT
2001
Springer
106views Cryptology» more  SACRYPT 2001»
15 years 11 months ago
Fast Normal Basis Multiplication Using General Purpose Processors
—For cryptographic applications, normal bases have received considerable attention, especially for hardware implementation. In this article, we consider fast software algorithms ...
Arash Reyhani-Masoleh, M. Anwarul Hasan
AES
2000
Springer
136views Cryptology» more  AES 2000»
15 years 11 months ago
Preliminary Cryptanalysis of Reduced-Round Serpent
Serpent is a 32-round AES block cipher finalist. In this paper we present several attacks on reduced-round variants of Serpent that require less work than exhaustive search. We at...
Tadayoshi Kohno, John Kelsey, Bruce Schneier
AES
2000
Springer
107views Cryptology» more  AES 2000»
15 years 11 months ago
Speeding up Serpent
We present a method for finding efficient instruction sequences for the Serpent S-boxes. Current implementations need many registers to store temporary variables, yet the common ...
Dag Arne Osvik