Selected Areas in Cryptography -- SAC 2014

This book constitutes the proceedings of the 21st International Conference on Selected Areas in Cryptography, SAC 2014, held in Montreal, QC, Canada, in August 2014.
The 22 papers presented in this volume were carefully reviewed and selected from 103 submissions. There are four areas covered at each SAC conference. The three permanent areas are: design and analysis of symmetric key primitives and cryptosystems, including block and stream ciphers, hash function, MAC algorithms, cryptographic permutations, and authenticated encryption schemes; efficient implementations of symmetric and public key algorithms; mathematical and algorithmic aspects of applied cryptology. This year, the fourth area for SAC 2014 is: algorithms for cryptography, cryptanalysis and their complexity analysis.

Includes supplementary material: sn.pub/extras

Inhalt

Malicious Hashing: Eve's Variant of SHA-1.- Binary Elligator Squared.- Batch NFS.- An Improvement of Linear Cryptanalysis with Addition Operations with Applications to FEAL-8X.- Colliding Keys for SC2000-256.- Faster Binary-Field Multiplication and Faster Binary-Field MACs.- OMD: A Compression Function Mode of Operation for Authenticated Encryption.- Security Amplification for the Composition of Block Ciphers: Simpler Proofs and New Results.- Improved Differential Cryptanalysis of Round-Reduced Speck.- Differential Cryptanalysis of SipHash.- Weak Instances of PLWE.- The Usage of Counter Revisited: Second-Preimage Attack on New Russian Standardized Hash Function.- Side-Channel Analysis of Montgomery's Representation Randomization.- Practical Cryptanalysis of PAES.- Diffusion Matrices from Algebraic-Geometry Codes with Efficient SIMD Implementation.- Error-Tolerant Side-Channel Cube Attack Revisited.- A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups.- Linear Biases in AEGIS Keystream.- Chaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers.- Fast Point Multiplication Algorithms for Binary Elliptic Curves with and Without Precomputation.- Partial Key Exposure Attacks on RSA: Achieving the Boneh-Durfee Bound.- Solving the Discrete Logarithm of a 113-bit Koblitz Curve with an FPGA Cluster.