Progress in Cryptology - INDOCRYPT 2001

1. Front Matter

   Pages I-XIII

   PDF

2. Invited Lecture

   1. Cryptographic Functions and Design Criteria for Block Ciphers

      • Anne Canteaut

      Pages 1-16

3. Hashing

   1. Mobile Agent Route Protection through Hash-Based Mechanisms

      • Josep Domingo-Ferrer

      Pages 17-29

   2. A New Anonymous Fingerprinting Scheme with High Enciphering Rate

      • Minoru Kuribayashi, Hatsukazu Tanaka

      Pages 30-39

   3. A Parallel Algorithm for Extending Cryptographic Hash Functions

      • Palash Sarkar, Paul J. Schellenberg

      Pages 40-49

   4. Incremental Hash Function Based on Pair Chaining & Modular Arithmetic Combining

      • Bok-Min Goi, M. U. Siddiqi, Hean-Teik Chuah

      Pages 50-61

4. Algebraic Schemes

   1. Multiples of Primitive Polynomials over GF(2)

      • Kishan Chand Gupta, Subhamoy Maitra

      Pages 62-72

   2. Fast Generation of Cubic Irreducible Polynomials for XTR

      • Jae Moon Kim, Ikkwon Yie, Seung Ik Oh, Hyung Don Kim, Jado Ryu

      Pages 73-78

   3. Cheating Prevention in Secret Sharing over GF(p ^t)

      • Josef Pieprzyk, Xian-Mo Zhang

      Pages 79-90

5. Elliptic Curves

   1. An Application of Sieve Methods to Elliptic Curves

      • S. Ali Miri, V. Kumar Murty

      Pages 91-98

   2. Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography

      • Harald Baier

      Pages 99-107

   3. A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography

      • Mathieu Ciet, Jean-Jacques Quisquater, Francesco Sica

      Pages 108-116

6. Coding Theory

   1. Frameproof and IPP Codes

      • Palash Sarkar, Douglas R. Stinson

      Pages 117-126

   2. Linear Authentication Codes: Bounds and Constructions

      • Rei Safavi-Naini, Huaxiong Wang, Chaoping Xing

      Pages 127-135

7. Applications -I

   1. Selective Receipt in Certified E-mail

      • Steve Kremer, Olivier Markowitch

      Pages 136-148

   2. Spatial Domain Digital Watermarking with Buyer Authentication

      • Subhamoy Maitra, Dipti Prasad Mukherjee

      Pages 149-161

   3. Efficient Public Auction with One-Time Registration and Public Verifiability

      • Byoungcheon Lee, Kwangjo Kim, Joongsoo Ma

      Pages 162-174

   4. An Analysis of Integrity Services in Protocols

      • Kapali Viswanathan, Colin Boyd, Ed Dawson

      Pages 175-187

8. Cryptanalysis

   1. Cryptanalysis of the Nonlinear FeedForward Generator

      • S. S. Bedi, N. Rajesh Pillai

      Pages 188-194

   2. Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree

      • Markus Maurer, Alfred Menezes, Edlyn Teske

      Pages 195-213

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.

• Computational Algebraic Number Theory
• Cryptoanalyse
• Cryptographics Functions
• Cryptosysteme
• Data Encryption
• Digital Auctions
• Digital Signatures
• Information Security
• Public Key Cryptography
• algorithms
• coding theory
• complexity
• email
• finite field
• online
• algorithm analysis and problem complexity

• Department of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai, India

  C. Pandu Rangan

• Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong

  Cunsheng Ding

Policies and ethics