Fast Software Encryption

1. Front Matter

   PDF

2. Stream Ciphers I

   1. Cryptanalysis of Achterbahn

      • Thomas Johansson, Willi Meier, Frédéric Muller

      Pages 1-14

   2. Cryptanalysis of Grain

      • Côme Berbain, Henri Gilbert, Alexander Maximov

      Pages 15-29

   3. Cryptanalysis of the Stream Cipher DECIM

      • Hongjun Wu, Bart Preneel

      Pages 30-40

3. Block Ciphers

   1. On Feistel Structures Using a Diffusion Switching Mechanism

      • Taizo Shirai, Kyoji Shibutani

      Pages 41-56

   2. Pseudorandom Permutation Families over Abelian Groups

      • Louis Granboulan, Éric Levieil, Gilles Piret

      Pages 57-77

   3. A Zero-Dimensional Gröbner Basis for AES-128

      • Johannes Buchmann, Andrei Pyshkin, Ralf-Philipp Weinmann

      Pages 78-88

4. Hash Functions I

   1. Cryptanalysis of the Full HAVAL with 4 and 5 Passes

      • Hongbo Yu, Xiaoyun Wang, Aaram Yun, Sangwoo Park

      Pages 89-110

   2. Collisions and Near-Collisions for Reduced-Round Tiger

      • John Kelsey, Stefan Lucks

      Pages 111-125

   3. Analysis of Step-Reduced SHA-256

      • Florian Mendel, Norbert Pramstaller, Christian Rechberger, Vincent Rijmen

      Pages 126-143

5. Analysis

   1. Improved Linear Distinguishers for SNOW 2.0

      • Kaisa Nyberg, Johan Wallén

      Pages 144-162

   2. Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators

      • Matthias Krause, Dirk Stegemann

      Pages 163-178

   3. Breaking the ICE – Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions

      • Jonathan J. Hoch, Adi Shamir

      Pages 179-194

6. Proposals

   1. A New Dedicated 256-Bit Hash Function: FORK-256

      • Deukjo Hong, Donghoon Chang, Jaechul Sung, Sangjin Lee, Seokhie Hong, Jaesang Lee et al.

      Pages 195-209

   2. Some Plausible Constructions of Double-Block-Length Hash Functions

      • Shoichi Hirose

      Pages 210-225

   3. Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations

      • Kazuhiko Minematsu, Yukiyasu Tsunoo

      Pages 226-241

7. Hash Functions II

   1. Searching for Differential Paths in MD4

      • Martin Schläffer, Elisabeth Oswald

      Pages 242-261

   2. A Study of the MD5 Attacks: Insights and Improvements

      • John Black, Martin Cochran, Trevor Highland

      Pages 262-277

   3. The Impact of Carries on the Complexity of Collision Attacks on SHA-1

      • Florian Mendel, Norbert Pramstaller, Christian Rechberger, Vincent Rijmen

      Pages 278-292

8. Modes and Models

   1. A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation

      • Debrup Chakraborty, Palash Sarkar

      Pages 293-309

Fast Software Encryption (FSE) 2006 is the 13th in a series of workshops on symmetric cryptography. It has been sponsored for the last ?ve years by the International Association for Cryptologic Research (IACR), and previous FSE workshops have been held around the world: 1993 Cambridge, UK 1994 Leuven, Belgium 1996 Cambridge, UK 1997 Haifa, Israel 1998 Paris, France 1999 Rome, Italy 2000 New York, USA 2001 Yokohama, Japan 2002 Leuven, Belgium 2003 Lund, Sweden 2004 New Delhi, India 2005 Paris, France The FSE workshop is devoted to research on fast and secure primitives for symmetric cryptography, including the design and analysis of block ciphers, stream ciphers, encryption schemes, analysis and evaluation tools, hash fu- tions, and message authentication codes. This year more than 100 papers were submitted to FSE for the ?rst time. After an extensive review by the ProgramCommittee, 27 papers were presented at the workshop. Of course, the programwould not have been complete without the invited speaker, and the presentation by Eli Biham on the early history of di?erential cryptanalysis was particularly appreciated by workshop attendees.

• AES
• MAC
• advanced encryption standard
• authentication
• block ciphers
• calculus
• complexity
• cryptanalysis
• cryptographic attacks
• cryptographic protocols
• cryptology
• message authencication
• random sequence
• security
• stream cip
• algorithm analysis and problem complexity

• Orange Labs, Issy les Moulineaux, France

  Matthew Robshaw