Paul C. van Oorschot (auth.), Colin Boyd (eds.)3540606939, 9783540606932
The volume presents 22 full revised papers selected from 48 submissions together with five invited full papers and three abstracts on the mathematical theory and practice of cryptography and coding; continuing advances in these strongly related areas are crucial for the security and reliability of data communication, processing, and storage. Among the topics addressed are linear codes, error-correcting codes, decoding, key distribution, authentication, hash functions, block ciphers, cryptanalysis, and electronic cash.
Table of contents :
Design choices and security implications in implementing Diffie-Hellman key agreement….Pages 1-1
A broadcast key distribution scheme based on block designs….Pages 2-12
Minimal supports in linear codes….Pages 13-13
Sequential decoding for a subcode of Reed Solomon Codes….Pages 14-21
Linear Span analysis of a set of periodic sequence generators….Pages 22-33
Minimal weight k -SR representations….Pages 34-43
The main conjecture for MDS codes….Pages 44-52
Some decoding applications of minimal realization….Pages 53-62
The synthesis of perfect sequences….Pages 63-73
Computation of low-weight parity checks for correlation attacks on stream ciphers….Pages 74-83
A storage complexity based analogue of Maurer key establishment using public channels….Pages 84-93
Soft decision decoding of Reed Solomon codes using the Dorsch algorithm….Pages 94-99
Good codes based on very sparse matrices….Pages 100-111
Quantum cryptography: Protecting our future networks with quantum mechanics….Pages 112-131
Prepaid electronic cheques using public-key certificates….Pages 132-141
How traveling salespersons prove their identity….Pages 142-149
An elliptic curve analogue of McCurley’s key agreement scheme….Pages 150-157
Multi-dimensional ring TCM codes for fading channels….Pages 158-168
Authentication codes: An area where coding and cryptology meet….Pages 169-183
Efficient generation of binary words of given weight….Pages 184-187
Distribution of recurrent sequences modulo prime powers….Pages 188-189
On-line secret sharing….Pages 190-198
Church-Rosser codes….Pages 199-204
A new algorithm for finding minimum-weight words in large linear codes….Pages 205-212
Coding and cryptography for speech and vision….Pages 213-236
Some constructions of generalised concatenated codes based on unit memory codes….Pages 237-256
A note on the hash function of Tillich and Zémor….Pages 257-263
Cryptanalysis of Harari’s identification scheme….Pages 264-269
Analysis of sequence segment keying as a method of CDMA transmission….Pages 270-281
Constructions for variable-length error-correcting codes….Pages 282-291
Reviews
There are no reviews yet.