Fast Software Encryption 2005

February 21-23
ENSTA, Paris, France

List of Accepted Papers

013Some Attacks on the Bit-Search Generator
Martin Hell and Thomas Johansson
Lund University
015The Poly1305-AES Message-Authentication Code
Daniel J. Bernstein
University of Illinois at Chicago
016SMASH — A Cryptographic Hash Function
Lars R. Knudsen
Technical University of Denmark
018New Combined Attacks on Block Ciphers
Eli Biham and Orr Dunkelman and Nathan Keller
Technion, Israel and Technion, Israel and Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Israel
019Small Scale Variants of the AES
Carlos Cid and Sean Murphy and Matt Robshaw
024Analysis of the Non-linear Part of Mugi
Alex Biryukov and Adi Shamir
027DPA attacks and S-boxes
Emmanuel Prouff
Oberthur Card Systems
030F-FCSR: Design of a New Class of Stream Ciphers
François Arnault and Thierry P. Berger
Université de Limoges (LACO)
040Security Analysis of a 2/3-rate Double Length Compression Function in Black-Box Model
Mridul Nandi and Wonil Lee and Kouichi Sakurai and Sangjin Lee
041Narrow T-functions
Magnus Daum
Ruhr University Bochum
049A New Distinguisher for Clock Controlled Stream Ciphers
Håkan Englund and Thomas Johansson
Lund University
051Two Linear Distinguishing Attacks on VMPC and RC4A and Weakness of RC4 Family of Stream Ciphers
Alexander Maximov
Lund University
052How to Enhance the Security of the 3GPP Confidentiality and Integrity Algorithms
Tetsu Iwata and Kaoru Kurosawa
Ibaraki University
053On Proper Shrinking Components and the Bit-Search Generator
Nicolas T. Courtois and Blandine Debraize
To be merged with 92
056Preimage and Collision Attacks on MD2
Lars R. Knudsen and John E. Mathiassen
Technical University of Denmark and University of Bergen, Norway
060Padding oracle attacks on CBC-mode encryption with random and secret IVs
Arnold K.L. Yau and Kenneth G. Paterson and Chris J. Mitchell
Information Security Group, Royal Holloway, University of London
063How to Maximize Software Performance of Symmetric Primitives on Pentium III and 4 Processors
Mitsuru Matsui and Sayaka Fukuda
Mitsubishi Electric
064Cryptographically Significant Boolean Functions: Construction and Analysis in Terms of Algebraic Immunity
Deepak Kumar Dalai and Kishan Chand Gupta and Subhamoy Maitra
Applied Statistic Unit, Indian Statistical Institute
066A Side-Channel Analysis Description of the AES S-box
Elisabeth Oswald and Stefan Mangard and Norbert Pramstaller and Vincent Rijmen
Graz University of Technology
070A New Class of Single Cycle T-functions
Jin Hong and Dong Hoon Lee and Yongjin Yeom and Daewan Han
National Security Research Institute, Korea
071Related-Key Rectangle Attacks on Reduced Version of SHACAL-1 and AES-192
Seokhie Hong and Jongsung Kim and Sangjin Lee and Bart Preneel
COSIC, K.U.Leuven and CIST, Korea Univ. and CIST, Korea Univ. and COSIC, K.U.Leuven
075Unbiased Random Sequences from Quasigroup String Transformations
Smile Markovski and Danilo Gligoroski and Ljupco Kocarev
Sts. Cyril and Methodius, Skopje, Macedonia and Sts. Cyril and Methodius, Skopje, Macedonia and University of California San Diego
078The ANF of the Composition of Addition and Multiplication mod $2^n$ with a Boolean Function
An Braeken and Igor Semaev
ESAT/COSIC K.U.Leuven and Dep. Mathematics K.U.Leuven
079New Applications of T-functions in Block Ciphers and Hash Functions
Alexander Klimov and Adi Shamir
Weizmann Institute of Science
086New Attacks against Reduced-Round Versions of IDEA
Pascal Junod
Ecole Polytechnique Fédérale de Lausane
089A New MAC Construction
Joan Daemen and Vincent Rijmen
STMicroeclectronics and IAIK, TUGraz and Cryptomathic
090Impossible Fault Analysis of RC4 and Differential Fault Analysis of RC4
Eli Biham and Louis Granboulan and Phong Q. Nguyen
091Two Attacks Against the HBB Stream Cipher
Antoine Joux and Frédéric Muller
DGA/University of Versailles Saint-Quentin and DCSSI Crypto Lab
092 Bit-search-based sequence filters
Aline Gouget and Hervé Sibert and Côme Berbain and Chris J. Mitchell
To be merged with 53
094Two-Pass Authenticated Encryption Faster than Generic Composition
Stefan Lucks
University of Mannheim