Book Volume 2259 2001

Selected Areas in Cryptography

8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16–17, 2001 Revised Papers


ISBN: 978-3-540-43066-7 (Print) 978-3-540-45537-0 (Online)

Table of contents (27 chapters)

previous Page of 2
  1. Front Matter

    Pages I-XI

  2. Cryptanalysis I

    1. Chapter

      Pages 1-24

      Weaknesses in the Key Scheduling Algorithm of RC4

    2. Chapter

      Pages 25-37

      A Practical Cryptanalysis of SSC2

    3. Chapter

      Pages 38-48

      Analysis of the E 0 Encryption System

  3. Boolean Functions

    1. Chapter

      Pages 49-59

      Boolean Functions with Large Distance to All Bijective Monomials: N Odd Case

    2. Chapter

      Pages 60-74

      Linear Codes in Constructing Resilient Functions with High Nonlinearity

    3. Chapter

      Pages 75-86

      New Covering Radius of Reed-Muller Codes for t-Resilient Functions

    4. Chapter

      Pages 87-102

      Generalized Zig-zag Functions and Oblivious Transfer Reductions

  4. Rijndael

    1. Chapter

      Pages 103-111

      A Simple Algebraic Representation of Rijndael

    2. Chapter

      Pages 112-128

      Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael

  5. Invited Talk I

    1. Chapter

      Pages 129-133

      Polynomial Reconstruction Based Cryptography

  6. Elliptic Curves and Efficient Implementation I

    1. Chapter

      Pages 134-150

      An Improved Implementation of Elliptic Curves over GF(2 n ) when Using Projective Point Arithmetic

    2. Chapter

      Pages 151-164

      Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves

    3. Chapter

      Pages 165-180

      Algorithms for Multi-exponentiation

    4. Chapter

      Pages 181-189

      Two Topics in Hyperelliptic Cryptography

  7. Cryptanalysis II

    1. Chapter

      Pages 190-198

      A Differential Attack on Reduced-Round SC2000

    2. Chapter

      Pages 199-211

      On the Complexity of Matsui’s Attack

    3. Chapter

      Pages 212-229

      Random Walks Revisited: Extensions of Pollard’s Rho Algorithm for Computing Multiple Discrete Logarithms

  8. Elliptic Curves and Efficient Implementation II

    1. Chapter

      Pages 230-244

      Fast Normal Basis Multiplication Using General Purpose Processors

    2. Chapter

      Pages 245-254

      Fast Multiplication of Integers for Public-Key Applications

    3. Chapter

      Pages 255-267

      Fast Simultaneous Scalar Multiplication on Elliptic Curve with Montgomery Form

previous Page of 2