default search action
2. FSE 1994: Leuven, Belgium
- Bart Preneel:
Fast Software Encryption: Second International Workshop. Leuven, Belgium, 14-16 December 1994, Proceedings. Lecture Notes in Computer Science 1008, Springer 1995 - Bart Preneel:
FSE'94 - Introduction. 1-5 - Ulrich Baum, Simon R. Blackburn:
Clock-Controlled Pseudorandom Generators on Finite Groups. 6-21 - William G. Chambers:
On Random Mappings and Random Permutations. 22-28 - Cunsheng Ding:
Binary Cyclotomic Generators. 29-60 - Hans Dobbertin:
Construction of Bent Functions and Balanced Boolean Functions with High Nonlinearity. 61-74 - Xuejia Lai:
Additive and Linear Structures of Cryptographic Functions. 75-85 - Ronald L. Rivest:
The RC5 Encryption Algorithm. 86-96 - Matt Blaze, Bruce Schneier:
The MacGuffin Block Cipher Algorithm. 97-110 - Kaisa Nyberg:
S-boxes and Round Functions with Controllable Linearity and Differential Uniformity. 111-130 - Luke O'Connor:
Properties of Linear Approximation Tables. 131-136 - Ross J. Anderson:
Searching for the Optimum Correlation Attack. 137-143 - Eli Biham, Paul C. Kocher:
A Known Plaintext Attack on the PKZIP Stream Cipher. 144-153 - Jovan Dj. Golic:
Linear Cryptanalysis of Stream Ciphers. 154-169 - Andrew Klapper:
Feedback with Carry Shift Registers over Finite Fields (extended abstract). 170-178 - David J. C. MacKay:
A Free Energy Minimization Framework for Inference Problems in modulo 2 Arithmetic. 179-195 - Lars R. Knudsen:
Truncated and Higher Order Differentials. 196-211 - James L. Massey:
SAFER K-64: One Year Later. 212-241 - Vincent Rijmen, Bart Preneel:
Improved Characteristics for Differential Cryptanalysis of Hash Functions Based on Block Ciphers. 242-248 - Burton S. Kaliski Jr., Matthew J. B. Robshaw:
Linear Cryptanalysis Using Multiple Approximations and FEAL. 249-264 - Uwe Blöcher, Markus Dichtl:
Problems with the Linear Cryptanalysis of DES Using More Than One Active S-box per Round. 265-274 - Joan Daemen, René Govaerts, Joos Vandewalle:
Correlation Matrices. 275-285 - Serge Vaudenay:
On the Need for Multipermutations: Cryptanalysis of MD4 and SAFER. 286-297 - Stefan Lucks:
How to Exploit the Intractability of Exact TSP for Cryptography. 298-304 - Michael Roe:
How to Reverse Engineer an EES Device. 305-328 - Walter T. Penzhorn:
A Fast Homomorphic Coding Algorithm Based on Arithmetic Coding. 329-345 - Ross J. Anderson:
On Fibonacci Keystream Generators. 346-352 - Vincent Rijmen, Bart Preneel:
Cryptanalysis of McGuffin. 353-358 - Michael Roe:
Performance of Block Ciphers and Hash Functions - One Year Later. 359-362 - David J. Wheeler, Roger M. Needham:
TEA, a Tiny Encryption Algorithm. 363-366
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.