Selected Areas in Cryptography: 8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16–17, 2001 Revised Papers
Author: Serge Vaudenay, Amr M. Youssef
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-43066-7
DOI: 10.1007/3-540-45537-X

Table of Contents:

• Weaknesses in the Key Scheduling Algorithm of RC4
  
• A Practical Cryptanalysis of SSC2
  
• Analysis of the E
  
• Boolean Functions with Large Distance to All Bijective Monomials: N Odd Case
  
• Linear Codes in Constructing Resilient Functions with High Nonlinearity
  
• New Covering Radius of Reed-Muller Codes for t-Resilient Functions
  
• Generalized Zig-zag Functions and Oblivious Transfer Reductions
  
• A Simple Algebraic Representation of Rijndael
  
• Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael
  
• Polynomial Reconstruction Based Cryptography
  
• An Improved Implementation of Elliptic Curves over GF(2
  
• Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves
  
• Algorithms for Multi-exponentiation
  
• Two Topics in Hyperelliptic Cryptography
  
• A Differential Attack on Reduced-Round SC2000
  
• On the Complexity of Matsui’s Attack
  
• Random Walks Revisited: Extensions of Pollard’s Rho Algorithm for Computing Multiple Discrete Logarithms
  
• Fast Normal Basis Multiplication Using General Purpose Processors
  
• Fast Multiplication of Integers for Public-Key Applications
  
• Fast Simultaneous Scalar Multiplication on Elliptic Curve with Montgomery Form