Selected Areas in Cryptography
Subtitle: 8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16-17, 2001. Revised Papers (Lecture Notes in Computer Science)
Contributors: Serge Vaudenay (Editor); Amr M. Youssef (Editor)
Edition: 1 edition
Publisher: Springer
Published: January 11, 2002
Language: eng
Format: Paperback
Number of pages: 359
ISBN-13: 9783540430667
Subjects: Data security & data encryption; Impact of computing & IT on society; Operating systems & graphical user interfaces (GUIs); Security; Congresses; Cryptography/Access Control; Computers; Computers - Operating Systems; Operating Systems - General; Computer Books: Operating Systems; Data encryption (Computer science); Computer Science; Security - General; Advanced Encryption Standard; Coding Theory; Computational Number Theory; Computers / Computer Science; Data Security; Information Security; Network Security; Privacy; Computer security; Data encryption (Computer scie
Description: Selected Areas in Cryptography: 8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16–17, 2001 Revised Papers<br />Author: Serge Vaudenay, Amr M. Youssef<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-43066-7<br /> DOI: 10.1007/3-540-45537-X<br /><br />Table of Contents:<p></p><ul><li>Weaknesses in the Key Scheduling Algorithm of RC4
</li><li>A Practical Cryptanalysis of SSC2
</li><li>Analysis of the E
</li><li>Boolean Functions with Large Distance to All Bijective Monomials: N Odd Case
</li><li>Linear Codes in Constructing Resilient Functions with High Nonlinearity
</li><li>New Covering Radius of Reed-Muller Codes for t-Resilient Functions
</li><li>Generalized Zig-zag Functions and Oblivious Transfer Reductions
</li><li>A Simple Algebraic Representation of Rijndael
</li><li>Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael
</li><li>Polynomial Reconstruction Based Cryptography
</li><li>An Improved Implementation of Elliptic Curves over GF(2
</li><li>Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves
</li><li>Algorithms for Multi-exponentiation
</li><li>Two Topics in Hyperelliptic Cryptography
</li><li>A Differential Attack on Reduced-Round SC2000
</li><li>On the Complexity of Matsui’s Attack
</li><li>Random Walks Revisited: Extensions of Pollard’s Rho Algorithm for Computing Multiple Discrete Logarithms
</li><li>Fast Normal Basis Multiplication Using General Purpose Processors
</li><li>Fast Multiplication of Integers for Public-Key Applications
</li><li>Fast Simultaneous Scalar Multiplication on Elliptic Curve with Montgomery Form</li></ul>