Progress in Cryptology - INDOCRYPT 2001

Second International Conference on Cryptology in India, Chennai, India, December 16-20, 2001

Häftad, Engelska, 2001

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the Second International Conference in Cryptology in India, INDOCRYPT 2001, held in Chennai, India in December 2001. The 31 revised full papers presented together with an invited survey were carefully reviewed and selected from 77 submissions. The papers are organized in topical sections on hashing, algebraic schemes, elliptic curves, coding theory, applications, cryptanalysis, distributed cryptography, Boolean functions, digitial signatures, and shift registers.

Produktinformation

Utgivningsdatum2001-12-05
Mått155 x 235 x 21 mm
Vikt563 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor358
Upplaga2001
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540430100

Tillhör följande kategorier

Referensverk och tvärvetenskap inom Samhalle och politik
Diskret matematik inom Naturvetenskap och teknik
Informationsteknik: allmänt inom Data och it
Hårdvara inom Data och it
Operativsystem inom Data och it
Programmeringsböcker inom Data och it
Systemvetenskap och AI inom Data och it
IT-säkerhet inom Data och it

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.