Selected Areas in Cryptography

15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers

  • Roberto Maria Avanzi
  • Liam Keliher
  • Francesco Sica
Conference proceedings SAC 2008

DOI: 10.1007/978-3-642-04159-4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5381)

Table of contents (29 papers)

  1. Front Matter
  2. Elliptic and Hyperelliptic Curve Arithmetic

    1. Faster Halvings in Genus 2
      Peter Birkner, Nicolas Thériault
      Pages 1-17
    2. On Software Parallel Implementation of Cryptographic Pairings
      Philipp Grabher, Johann Großschädl, Dan Page
      Pages 35-50
  3. Block Ciphers I

    1. The Cryptanalysis of Reduced-Round SMS4
      Jonathan Etrog, Matt J. B. Robshaw
      Pages 51-65
    2. Building Secure Block Ciphers on Generic Attacks Assumptions
      Jacques Patarin, Yannick Seurin
      Pages 66-81
  4. First Invited Talk

    1. Lifting and Elliptic Curve Discrete Logarithms
      Joseph H. Silverman
      Pages 82-102
  5. Hash Functions I

    1. Preimage Attacks on One-Block MD4, 63-Step MD5 and More
      Kazumaro Aoki, Yu Sasaki
      Pages 103-119
    2. Preimage Attacks on 3-Pass HAVAL and Step-Reduced MD5
      Jean-Philippe Aumasson, Willi Meier, Florian Mendel
      Pages 120-135
    3. Cryptanalysis of Tweaked Versions of SMASH and Reparation
      Pierre-Alain Fouque, Jacques Stern, Sébastien Zimmer
      Pages 136-150
  6. Mathematical Aspects of Applied Cryptography I

  7. Stream Ciphers Cryptanalysis

  8. Hash Functions II

    1. A Three-Property-Secure Hash Function
      Elena Andreeva, Bart Preneel
      Pages 228-244
    2. Analysis of the Collision Resistance of RadioGatúnUsing Algebraic Techniques
      Charles Bouillaguet, Pierre-Alain Fouque
      Pages 245-261
    3. A Scheme to Base a Hash Function on a Block Cipher
      Shoichi Hirose, Hidenori Kuwakado
      Pages 262-275
    4. Collisions and Other Non-random Properties for Step-Reduced SHA-256
      Sebastiaan Indesteege, Florian Mendel, Bart Preneel, Christian Rechberger
      Pages 276-293
  9. Cryptography with Algebraic Curves

    1. Public Verifiability from Pairings in Secret Sharing Schemes
      Somayeh Heidarvand, Jorge L. Villar
      Pages 294-308

About these proceedings


CAST-128 CAST-256 Error-correcting Code HAVAL HC-256 MD5 RFID SHA-256 SMS5 chinese remainder complexity cryptographic pairings cryptography elliptic curve side channel analysis

Editors and affiliations

  • Roberto Maria Avanzi
    • 1
  • Liam Keliher
    • 2
  • Francesco Sica
    • 3
  1. 1.Faculty of Mathematics and Horst Görtz Institute for IT-SecurityRuhr University BochumGermany
  2. 2.Department of Mathematics and Computer ScienceMount Allison UniversitySackvilleCanada
  3. 3.Department of Mathematics and Computer ScienceMount Allison University – AceCryptSackvilleCanada

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-04158-7
  • Online ISBN 978-3-642-04159-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349