Fast Software Encryption: 5th International Workshop, FSE ’98, Paris, France, March 23–25, 1998, Proceedings, Volume 5Serge Vaudenay Fast Software Encryption (FSE) is an annual research workshop devoted to the promotion of research on classical encryption algorithms and related cryp- graphic primitives such as hash functions. When public key cryptography started to receive wide attention in the 1980s, the much older and more basic art of secret key cryptography was sidelined at many research conferences. This motivated Ross Anderson to organise the rst FSE in Cambridge, England in December 1993; subsequent workshops followed at Leuven, Belgium (December 1994), Cambridge again (February 1996), and Haifa, Israel (January 1997). These proceedings contain the papers due to be presented at the fth FSE workshop in March 1998 at the Hotel du Louvre in Paris. This event is organized by the Ecole Normale Superieure and the Centre National pour la Recherche S- enti que (CNRS) in cooperation with the International Association for Cryp- logic Research (IACR), and has attracted the kind support of Gemplus and Microsoft, the world leaders in smart cards and software { two domains very closely connected to our research concerns. |
Contents
Cryptanalysis | 1 |
Higher Order Differential Attack of a CAST Cipher | 17 |
Cryptanalysis of TWOPRIME | 32 |
Copyright | |
14 other sections not shown
Other editions - View all
Common terms and phrases
Advances in Cryptology algorithm approximation bias Biham block cipher Boolean buffer bytes CAST cipher characteristic chosen-ciphertext ciphertext collision complexity compression function Computer Science cryptographic CS-CIPHER cycle decryption defined denote difference differential attack Differential Cryptanalysis equations Fast Software Encryption fprintf(stdout Hamming weight hardware hash functions higher order differential implementation input irreducible polynomial iteration K₁ key bits key scheduling keystream known-IV layer Lecture Notes lemma linear cryptanalysis linearized polynomial Ln mod LNCS meet-in-the-middle attack mixing function MIXING rounds mode Notes in Computer number of rounds operation order differential attack P₁ pairs Pentium permutation PRNG probability Proceedings processors Proof pseudorandom pseudorandom permutations queries random function recover result round function round key S-boxes S₁ scheme Section single encryptions Springer-Verlag stream cipher subkey Theorem trial encryptions triple TWOPRIME vector words zero