Selected Areas in Cryptography
Editat de Serge Vaudenay, Amr M. Youssefen Limba Engleză Paperback – 14 dec 2001
Preț: 325.06 lei
Preț vechi: 406.33 lei
-20% Nou
Puncte Express: 488
Preț estimativ în valută:
57.52€ • 67.08$ • 50.50£
57.52€ • 67.08$ • 50.50£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540430667
ISBN-10: 3540430660
Pagini: 376
Ilustrații: XII, 364 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.57 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540430660
Pagini: 376
Ilustrații: XII, 364 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.57 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Cryptanalysis 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 Elliptic Scalar Multiplication.- Public Key Systems.- The GH Public-Key Cryptosystem.- XTR Extended to GF(p 6m ).- Invited Talk II.- The Two Faces of Lattices in Cryptology.- Protocols and Mac.- New (Two-Track-)MAC Based on the Two Trails of RIPEMD.- Key Revocation with Interval Cover Families.- Timed-ReleaseCryptography.