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.
Author(s): Thomas Johansson, Willi Meier, Frédéric Muller (auth.), Matthew Robshaw (eds.)
Series: Lecture Notes in Computer Science 4047
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2006
Language: English
Pages: 434
Tags: Data Encryption; Algorithm Analysis and Problem Complexity; Coding and Information Theory; Discrete Mathematics in Computer Science
Front Matter....Pages -
Cryptanalysis of Achterbahn....Pages 1-14
Cryptanalysis of Grain....Pages 15-29
Cryptanalysis of the Stream Cipher DECIM....Pages 30-40
On Feistel Structures Using a Diffusion Switching Mechanism....Pages 41-56
Pseudorandom Permutation Families over Abelian Groups....Pages 57-77
A Zero-Dimensional Gröbner Basis for AES-128....Pages 78-88
Cryptanalysis of the Full HAVAL with 4 and 5 Passes....Pages 89-110
Collisions and Near-Collisions for Reduced-Round Tiger....Pages 111-125
Analysis of Step-Reduced SHA-256....Pages 126-143
Improved Linear Distinguishers for SNOW 2.0....Pages 144-162
Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators....Pages 163-178
Breaking the ICE – Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions....Pages 179-194
A New Dedicated 256-Bit Hash Function: FORK-256....Pages 195-209
Some Plausible Constructions of Double-Block-Length Hash Functions....Pages 210-225
Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations....Pages 226-241
Searching for Differential Paths in MD4....Pages 242-261
A Study of the MD5 Attacks: Insights and Improvements....Pages 262-277
The Impact of Carries on the Complexity of Collision Attacks on SHA-1....Pages 278-292
A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation....Pages 293-309
New Blockcipher Modes of Operation with Beyond the Birthday Bound Security....Pages 310-327
The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function....Pages 328-340
How Far Can We Go on the x64 Processors?....Pages 341-358
Computing the Algebraic Immunity Efficiently....Pages 359-374
Upper Bounds on Algebraic Immunity of Boolean Power Functions....Pages 375-389
Chosen-Ciphertext Attacks Against MOSQUITO....Pages 390-404
Distinguishing Attacks on the Stream Cipher Py....Pages 405-421
Resynchronization Attacks on WG and LEX....Pages 422-432
Back Matter....Pages -
