default search action
3. FSE 1996: Cambridge, UK
- Dieter Gollmann:
Fast Software Encryption, Third International Workshop, Cambridge, UK, February 21-23, 1996, Proceedings. Lecture Notes in Computer Science 1039, Springer 1996, ISBN 3-540-60865-6
Block Ciphers - Analysis
- Xuejia Lai, Rainer A. Rueppel:
Attacks on the HKM/HFX Cryptosystem. 1-14 - Lars R. Knudsen, Thomas A. Berson:
Truncated Differentials of SAFER. 15-26 - Serge Vaudenay:
On the Weak Keys of Blowfish. 27-32
Applications
- Matt Blaze:
High-Bandwidth Encryption with Low-Bandwidth Smartcards. 33-40 - Robert J. Jenkins Jr.:
ISAAC. 41-49
Hash Functions
- Willi Geiselmann:
A Note on the Hash Function of Tillich and Zémor. 51-52 - Hans Dobbertin:
Cryptanalysis of MD4. 53-69 - Hans Dobbertin, Antoon Bosselaers, Bart Preneel:
RIPEMD-160: A Strengthened Version of RIPEMD. 71-82 - Kaisa Nyberg:
Fast Accumulated Hashing. 83-87 - Ross J. Anderson, Eli Biham:
TIGER: A Fast New Hash Function. 89-97
Block Ciphers - Proposals
- Vincent Rijmen, Joan Daemen, Bart Preneel, Antoon Bosselaers, Erik De Win:
The Cipher SHARK. 99-111 - Ross J. Anderson, Eli Biham:
Two Practical and Provably Secure Block Ciphers: BEARS and LION. 113-120 - Bruce Schneier, John Kelsey:
Unbalanced Feistel Networks and Block Cipher Design. 121-144 - Andrew J. Clark, Jovan Dj. Golic, Ed Dawson:
A Comparison of Fast Correlation Attacks. 145-157 - Walter T. Penzhorn:
Correlation Attacks on Stream Ciphers: Computing Low-Weight Parity Checks Based on Error-Correcting Codes. 159-172 - Jovan Dj. Golic:
On the Security of Nonlinear Filter Generators. 173-188 - Stefan Lucks:
Faster Luby-Rackoff Ciphers. 189-203 - Mitsuru Matsui:
New Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis. 205-218
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.