Progress in Cryptology - INDOCRYPT 2001 [electronic resource] : Second International Conference on Cryptology in India, Chennai, India, December 16-20, 2001 /

Invited Lecture -- Cryptographic Functions and Design Criteria for Block Ciphers -- Hashing -- Mobile Agent Route Protection through Hash-Based Mechanisms -- A New Anonymous Fingerprinting Scheme with High Enciphering Rate -- A Parallel Algorithm for Extending Cryptographic Hash Functions -- Incremental Hash Function Based on Pair Chaining & Modular Arithmetic Combining -- Algebraic Schemes -- Multiples of Primitive Polynomials over GF(2) -- Fast Generation of Cubic Irreducible Polynomials for XTR -- Cheating Prevention in Secret Sharing over GF(p t) -- Elliptic Curves -- An Application of Sieve Methods to Elliptic Curves -- Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography -- A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography -- Coding Theory -- Frameproof and IPP Codes -- Linear Authentication Codes: Bounds and Constructions -- Applications -I -- Selective Receipt in Certified E-mail -- Spatial Domain Digital Watermarking with Buyer Authentication -- Efficient Public Auction with One-Time Registration and Public Verifiability -- An Analysis of Integrity Services in Protocols -- Cryptanalysis -- Cryptanalysis of the Nonlinear FeedForward Generator -- Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree -- Cryptanalysis of Imai and Matsumoto Scheme B Asymmetric Cryptosystem -- Distributed Cryptography -- Robust and Secure Broadcasting -- Toward Optimal Player Weights in Secure Distributed Protocols -- Boolean Functions -- Autocorrelation Properties of Correlation Immune Boolean Functions -- On the Constructing of Highly Nonlinear Resilient Boolean Functions by Means of Special Matrices -- Digital Signatures -- A Twin Algorithm for Efficient Generation of Digital Signatures -- Efficient “on the Fly” Signature Schemes Based on Integer Factoring -- Shift Registers -- Clock-Controlled Shift Registers and Generalized Geffe Key-Stream Generator -- Efficient Software Implementation of Linear Feedback Shift Registers -- Comments on a Signature Scheme Based on the Third Order LFSR Proposed at ACISP2001 -- Applications -II -- Pseudo-random Bit Generator Based on Couple Chaotic Systems and Its Applications in Stream-Cipher Cryptography -- Re-dividing Complexity between Algorithms and Keys -- A Tool Box of Cryptographic Functions Related to the Diffie-Hellman Function.

INDOCRYPT 2001, the Second Annual Crypto Conference, is proof of the s- ni?cant amount of enthusiasm generated among Indian as well as International crypto communities. INDOCRYPT 2001 was organized by the Indian Institute of Technology, Madras and the Institute of Mathematical Sciences, also located in Madras (now Chennai). This event was enthusiastically co-sponsored by eAl- traz ConsultingPrivate Ltd, Chennai, Odyssey Technologies Ltd, Chennai, and Shanmuga Arts Science Technology and Research Academy (SASTRA), Th- javur. The Program Committee Co-chair, Prof.C.Pandu Rangan was responsible for local organization and registration. The Program Committee considered 77 papers and selected 31 papers for presentation. These papers were selected on the basis of perceived originality, quality, and relevance to the ?eld of cryptography. The proceedings include the revised version of the accepted papers. Revisions were not checked as to their contents and authors bear full responsibility for the contents of their submissions. The selection of papers is a very challengingand demandingtask. We wish to thank the Program Committee members who did an excellent job in reviewing the submissions in spite of severe time constraints imposed by the tight p- cessingschedule. Each submission was reviewed by at least three referees (only a few by two). The Program Committee was ably assisted by a large number of reviewers in their area of expertise. The list of reviewers has been provided separately. Our thanks go to all of them.