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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Roy, Bimal Kumar (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Okamoto, Eiji (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
• Έκδοση: 1st ed. 2000.
• Σειρά: Lecture Notes in Computer Science, 1977
• Θέματα: Data encryption (Computer science).; Computer communication systems.; Computer programming.; Algorithms.; Management information systems.; Computer science.; Operating systems (Computers).; Cryptology.; Computer Communication Networks.; Programming Techniques.; Algorithm Analysis and Problem Complexity.; Management of Computing and Information Systems.; Operating Systems.

The field of Cryptology witnessed a revolution in the late seventies. Since then it has been expanded into an important and exciting area of research. Over the last two decades, India neither participated actively nor did it contribute sig­ nificantly towards the development in this field. However,...

Πίνακας περιεχομένων:

• 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.