Selected Areas in Cryptography: 8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16–17, 2001 Revised Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the thoroughly refereed post-proceedings of the 8th International Workshop on Selected Areas in Cryptology, SAC 2001, held in Toronto, Ontario, Canada in August 2001.
The 25 revised full papers presented together with the abstracts of two invited talks were carefully reviewed and selected during two rounds of refereeing and revision. The papers are organized in topical sections on cryptanalysis, Boolean functions, Rijndael, elliptic curves and efficient implementation, public key systems, and protocols and MAC.

Author(s): Scott Fluhrer, Itsik Mantin, Adi Shamir (auth.), Serge Vaudenay, Amr M. Youssef (eds.)
Series: Lecture Notes in Computer Science 2259
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2001

Language: English
Pages: 364
Tags: Data Encryption; Operating Systems; Computers and Society; Algorithm Analysis and Problem Complexity; Computer Communication Networks; Computational Science and Engineering

Weaknesses in the Key Scheduling Algorithm of RC4....Pages 1-24
A Practical Cryptanalysis of SSC2....Pages 25-37
Analysis of the E 0 Encryption System....Pages 38-48
Boolean Functions with Large Distance to All Bijective Monomials: N Odd Case....Pages 49-59
Linear Codes in Constructing Resilient Functions with High Nonlinearity....Pages 60-74
New Covering Radius of Reed-Muller Codes for t -Resilient Functions....Pages 75-86
Generalized Zig-zag Functions and Oblivious Transfer Reductions....Pages 87-102
A Simple Algebraic Representation of Rijndael....Pages 103-111
Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael....Pages 112-128
Polynomial Reconstruction Based Cryptography....Pages 129-133
An Improved Implementation of Elliptic Curves over GF(2 n ) when Using Projective Point Arithmetic....Pages 134-150
Fast Generation of Pairs ( k , [ k ] P ) for Koblitz Elliptic Curves....Pages 151-164
Algorithms for Multi-exponentiation....Pages 165-180
Two Topics in Hyperelliptic Cryptography....Pages 181-189
A Differential Attack on Reduced-Round SC2000....Pages 190-198
On the Complexity of Matsui’s Attack....Pages 199-211
Random Walks Revisited: Extensions of Pollard’s Rho Algorithm for Computing Multiple Discrete Logarithms....Pages 212-229
Fast Normal Basis Multiplication Using General Purpose Processors....Pages 230-244
Fast Multiplication of Integers for Public-Key Applications....Pages 245-254
Fast Simultaneous Scalar Multiplication on Elliptic Curve with Montgomery Form....Pages 255-267
On the Power of Multidoubling in Speeding Up Elliptic Scalar Multiplication....Pages 268-283
The GH Public-Key Cryptosystem....Pages 284-300
XTR Extended to GF( p 6m )....Pages 301-312
The Two Faces of Lattices in Cryptology....Pages 313-313
New (Two-Track-)MAC Based on the Two Trails of RIPEMD....Pages 314-324
Key Revocation with Interval Cover Families....Pages 325-341
Timed-Release Cryptography....Pages 342-357