Selected Areas in Cryptography -- SAC 2013 de Tanja Lange

Selected Areas in Cryptography -- SAC 2013

Tanja Lange

Kristin Lauter

Petr Lison¿k

en Limba Engleză Paperback – 11 iun 2014

This book constitutes the proceedings of the 20th International Conference on Selected Areas in Cryptography, SAC 2013, held in Burnaby, Canada, in August 2013. The 26 papers presented in this volume were carefully reviewed and selected from 98 submissions. They are organized in topical sections named: lattices; discrete logarithms; stream ciphers and authenticated encryption; post-quantum (hash-based and system solving); white box crypto; block ciphers; elliptic curves, pairings and RSA; hash functions and MACs; and side-channel attacks. The book also contains 3 full-length invited talks.

Citește tot Restrânge

Cuprins

The Realm of the Pairings.- A Three-Level Sieve Algorithm for the Shortest Vector Problem.- Improvement and Efficient Implementation of a Lattice-based Signature Scheme.- Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware.- Practical approaches to varying network size in combinatorial key pre distribution schemes.- Similarities between encryption and decryption: how far can we go.- A Group Action on Z p and the Generalized DLP with Auxiliary Inputs.- Solving a 6120-bit DLP on a Desktop Computer.- Stream ciphers and authenticated encryption How to Recover Any Byte of Plaintext on RC4.- The LOCAL attack: Cryptanalysis of the authenticated encryption scheme ALE.- AEGIS: A Fast Authenticated Encryption Algorithm.- Fast Exhaustive Search for Quadratic Systems in F2 on FPGAs.- Faster Hash-based Signatures with Bounded Leakage.- White-Box Security Notions for Symmetric Encryption Schemes.- Two Attacks on a White-Box AES Implementation.- Extended Generalized Feistel Networks using Matrix Representation.- Zero-Correlation Linear Cryptanalysis with FFT and Improved Attacks on ISO Standards Camellia and CLEFIA.- Implementing Lightweight Block Ciphers on x86 Architectures.- A new index calculus algorithm with complexity L(1=4 + o(1)) in small characteristic.- High Precision Discrete Gaussian Sampling on FPGAs.- Discrete Ziggurat: A Time-Memory Trade-o for Sampling from a Gaussian Distribution over the Integers.- Elliptic Curves, Pairings and RSA A High-Speed Elliptic Curve Cryptographic Processor for Generic Curves over GF(p).- Exponentiating in Pairing Groups.- Faster Repeated Doublings on Binary Elliptic Curves.- Montgomery Multiplication Using Vector Instructions.- Improved Single-Key Distinguisher on HMAC-MD5 and Key Recovery Attacks on Sandwich-MAC-MD5.- Provable Second Preimage Resistance Revisited.- Multiple Limited-Birthday Distinguishers and Applications.- Horizontal Collision Correlation Attack on Elliptic Curves.- When Reverse-Engineering Meets Side-Channel Analysis - Digital Lock picking in Practice.