FSE 1993 | Sciweavers

15

FSE
1993
Springer

89views Cryptology» more FSE 1993»

13 years 8 months ago

Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a m...

Claus-Peter Schnorr, Serge Vaudenay

claim paper

Read More »

19

click to vote

FSE
1993
Springer

148views Cryptology» more FSE 1993»

Design Principles for Dedicated Hash Functions

13 years 8 months ago

Download www.cosic.esat.kuleuven.be

Abstract. Dedicated hash functions are cryptographically secure compression functions which are designed speciﬁcally for hashing. They intend to form a practical alternative for ...

Bart Preneel

claim paper

Read More »

14

click to vote

FSE
1993
Springer

101views Cryptology» more FSE 1993»

SAFER K-64: A Byte-Oriented Block-Ciphering Algorithm

13 years 8 months ago

Download www.isiweb.ee.ethz.ch

: A new non-proprietary secret-key block-enciphering algorithm, SAFER K-64 (for Secure And Fast Encryption Routine with a Key of length 64 bits) is described. The blocklength is 64...

James L. Massey

claim paper

Read More »

8

click to vote

FSE
1993
Springer

81views Cryptology» more FSE 1993»

Performance of Symmetric Ciphers and One-Way Hash Functions

13 years 8 months ago