Youssef / Vaudenay | Selected Areas in Cryptography | Buch | 978-3-540-43066-7 | sack.de

Buch, Englisch, Band 2259, 364 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1170 g

Reihe: Lecture Notes in Computer Science

Youssef / Vaudenay

Selected Areas in Cryptography

8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16-17, 2001. Revised Papers
2001
ISBN: 978-3-540-43066-7
Verlag: Springer Berlin Heidelberg

8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16-17, 2001. Revised Papers

Buch, Englisch, Band 2259, 364 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1170 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-43066-7
Verlag: Springer Berlin Heidelberg


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.

Youssef / Vaudenay Selected Areas in Cryptography jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


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.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.