Selected Areas in Cryptography 密码术的选定区

The LNCS series reports state-of-the-art results in computer science research，development，and education，at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community，with numerous individuals，as well as with prestigious organizations and societies，LNCS has grown into the most comprehensive computer science research forum available.
The scope of LNCS，including its subseries LNAI，spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes.
—proceedings （published in time for the respective conference）
—post-proceedings （consisting of thoroughly revised final full papers）
—research monographs（which may be based on outstanding PhD work，research projects，technical reports，etc.）.

在线阅读本书

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.

CryptanalysisⅠ
Weaknesses in the Key Scheduling Algorithm of RC4
A Practical Cryptanalysis of SSC2
Analysis of the E0 Encryption System
Boolean Functions
Boolean Functions with Large Distance to All Bijective Monomials:N Odd Case
Linear Codes in Consruction Resilient Functions With High Nonlinearity
New Covering Radus of Redd-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 Ⅰ
Polynomial Reconstruction Based Cryptoraphy
Elliptic Curves and Efficient ImplementationⅠ
An Improved Implementation of Elliptic Curves over GF(2n)when Using Projective Point Arithmetic
Fast Generation of Pairs(k，[k]P）for koblitz Elliptic Curves
Algorithms for Multi-exponentiation
Two Topics ini Hyperelliptic Cryptography
CryptanalysisⅡ
A Differential Attack on Reduced-Round C2000
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Ⅱ
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
……
Public Key Systems
Invited TalkⅡ
Protocols and Mac
Author Index
ⅡⅢⅣⅤ