Progress in Cryptology - INDOCRYPT 2000

First International Conference in Cryptology in India, Calcutta, India, December 10-13, 2000. Proceedings

AvBimal Kumar Roy,Eiji Okamoto

Häftad, Engelska, 2000

Del i serien Lecture Notes in Computer Science

554 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the First International Conference on Cryptology in India, INDOCRYPT 2000, held in Calcutta, India in December 2000. The 25 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. The book offers topical sections on stream ciphers and Boolean functions, cryptoanalysis: stream ciphers, cryptanalysis: block ciphers, electronic cash and multiparty computation, digital signatures, elliptic curves, fast arithmetic, cryptographic protocols, and block cipher and public key cryptography.

Produktinformation

Utgivningsdatum:2000-11-29
Mått:155 x 235 x 17 mm
Vikt:476 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:302
Upplaga:2000
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540414520

Utforska kategorier

Nätverk och kommunikation inom Data och IT
Programmeringsböcker inom Data och IT
IT-säkerhet inom Data och IT

Innehållsförteckning

Stream Ciphers and Boolean Functions.- The Correlation of a Boolean Function with Its Variables.- On Choice of Connection-Polynomials for LFSR-Based Stream Ciphers.- On Resilient Boolean Functions with Maximal Possible Nonlinearity.- Cryptanalysis I : Stream Ciphers.- Decimation Attack of Stream Ciphers.- Cryptanalysis of the A5/1 GSM Stream Cipher.- Cryptanalysis II : Block Ciphers.- On Bias Estimation in Linear Cryptanalysis.- On the Incomparability of Entropy and Marginal Guesswork in Brute-Force Attacks.- Improved Impossible Differentials on Twofish.- Electronic Cash & Multiparty Computation.- An Online, Transferable E-Cash Payment System.- Anonymity Control in Multi-bank E-Cash System.- Efficient Asynchronous Secure Multiparty Distributed Computation.- Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation.- Digital Signatures.- Codes Identifying Bad Signatures in Batches.- Distributed Signcryption.- Fail-Stop Signature for Long Messages (Extended Abstract).- Elliptic Curves.- Power Analysis Breaks Elliptic Curve Cryptosystems Even Secure against the Timing Attack.- Efficient Construction of Cryptographically Strong Elliptic Curves.- Fast Arithmetic.- High-Speed Software Multiplication in F2m.- On Efficient Normal Basis Multiplication.- Cryptographic Protocols.- Symmetrically Private Information Retrieval.- Two-Pass Authenticated Key Agreement Protocol with Key Confirmation.- Anonymous Traceability Schemes with Unconditional Security.- Block Ciphers & Public Key Cryptography.- New Block Cipher DONUT Using Pairwise Perfect Decorrelation.- Generating RSA Keys on a Handheld Using an Untrusted Server.- A Generalized Takagi-Cryptosystem with a Modulus of the Form prqs.