Selected Areas in Cryptography 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers / [electronic resource] : edited by Roberto Maria Avanzi, Liam Keliher, Francesco Sica. - Berlin, Heidelberg : Springer Berlin Heidelberg, 2009. - XI, 457 p. online resource. - Lecture Notes in Computer Science, 5381 0302-9743 ; . - Lecture Notes in Computer Science, 5381 .

Elliptic and Hyperelliptic Curve Arithmetic -- Faster Halvings in Genus 2 -- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates -- On Software Parallel Implementation of Cryptographic Pairings -- Block Ciphers I -- The Cryptanalysis of Reduced-Round SMS4 -- Building Secure Block Ciphers on Generic Attacks Assumptions -- First Invited Talk -- Lifting and Elliptic Curve Discrete Logarithms -- Hash Functions I -- Preimage Attacks on One-Block MD4, 63-Step MD5 and More -- Preimage Attacks on 3-Pass HAVAL and Step-Reduced MD5 -- Cryptanalysis of Tweaked Versions of SMASH and Reparation -- Mathematical Aspects of Applied Cryptography I -- Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences -- On the Exact Success Rate of Side Channel Analysis in the Gaussian Model -- Stream Ciphers Cryptanalysis -- Algebraic and Correlation Attacks against Linearly Filtered Non Linear Feedback Shift Registers -- A Cache Timing Analysis of HC-256 -- An Improved Fast Correlation Attack on Stream Ciphers -- Hash Functions II -- A Three-Property-Secure Hash Function -- Analysis of the Collision Resistance of RadioGatúnUsing Algebraic Techniques -- A Scheme to Base a Hash Function on a Block Cipher -- Collisions and Other Non-random Properties for Step-Reduced SHA-256 -- Cryptography with Algebraic Curves -- Public Verifiability from Pairings in Secret Sharing Schemes -- The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences -- Second Invited Talk – Stafford Tavares Lecture -- The “Coefficients H” Technique -- Mathematical Aspects of Applied Cryptography II -- Distinguishing Multiplications from Squaring Operations -- Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering -- Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators -- Curve-Based Primitives in Hardware -- HECC Goes Embedded: An Area-Efficient Implementation of HECC -- ECC Is Ready for RFID – A Proof in Silicon -- Block Ciphers II -- Cryptanalysis of a Generic Class of White-Box Implementations -- New Linear Cryptanalytic Results of Reduced-Round of CAST-128 and CAST-256 -- Improved Impossible Differential Cryptanalysis of Reduced-Round Camellia.

9783642041594

10.1007/978-3-642-04159-4 doi


Computer science.
Data protection.
Data structures (Computer science).
Data encryption (Computer science).
Coding theory.
Computational complexity.
Algebra--Data processing.
Computer Science.
Data Encryption.
Systems and Data Security.
Coding and Information Theory.
Data Structures, Cryptology and Information Theory.
Discrete Mathematics in Computer Science.
Symbolic and Algebraic Manipulation.

QA76.9.A25

005.82
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha