Selected areas in cryptography

InhaltsverzeichnisCryptanalysis I.Weaknesses in the Key Scheduling Algorithm of RC4.A Practical Cryptanalysis of SSC2.Analysis of the E 0 Encryption System.Boolean Functions.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.Rijndael.A Simple Algebraic Representation of Rijndael.Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael.Invited Talk I.Polynomial Reconstruction Based Cryptography.Elliptic Curves and Efficient Implementation I.An Improved Implementation of Elliptic Curves over GF(2 n ) when Using Projective Point Arithmetic.Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves.Algorithms for Multi-exponentiation.Two Topics in Hyperelliptic Cryptography.Cryptanalysis II.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.Elliptic Curves and Efficient Implementation II.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.On the Power of Multidoubling in Speeding Up Ellipt