Progress in cryptology INDOCRYPT 2001 : Second International Conference on Cryptology in India, Chennai, India, December 16 20, 2001 : proceedings
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...
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
2247 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Progress in cryptology, INDOCRYPT 2001, Second International Conference on Cryptology in India, Chennai, India, December 16-20, 2001, proceedings, C. Pandu Rangan, Cunsheng Ding (eds.), Berlin, Springer, 2001, 1 vol. (XIII-349 p.), Lecture notes in computer science, 3-540-43010-5 • Progress in Cryptology - INDOCRYPT 2001, Texte imprimé, 9783662198971 |
Indholdsfortegnelse:
- 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.