Cryptography and Coding: 8th IMA International Conference Cirencester, UK, December 17–19, 2001 Proceedings

A. Al Jabri (auth.), Bahram Honary (eds.)3540430261, 9783540430261

The mathematical theory and practice of cryptography and coding underpins the provision of effective security and reliability for data communication, processing, and storage. Theoretical and implementational advances in the fields of cryptography and coding are therefore a key factor in facilitating the growth of data communications and data networks of various types. Thus, this Eight International Conference in an established and successful IMA series on the theme of “Cryptography and Coding” was both timely and relevant. The theme of this conference was the future of coding and cryptography, which was touched upon in presentations by a number of invited speakers and researchers. The papers that appear in this book include recent research and development in error control coding and cryptography. These start with mathematical bounds, statistical decoding schemes for error correcting codes, and undetected error probabilities and continue with the theoretical aspects of error correction coding such as graph and trellis decoding, multifunctional and multiple access communication systems, low density parity check codes, and iterative decoding. These are followed by some papers on key recovery attack, authentication, stream cipher design, and analysis of ECIES algorithms, and lattice attacks on IP based protocols.

---

Table of contents :
A Statistical Decoding Algorithm for General Linear Block Codes….Pages 1-8
On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory….Pages 9-19
The Complete Weight Enumerator for Codes over M nxs ( F q )….Pages 20-26
Further Improvement of Kumar-Rajagopalan-Sahai Coding Constructions for Blacklisting Problem….Pages 27-37
A Simple Soft-Input/Soft-Output Decoder for Hamming Codes….Pages 38-43
A Technique with an Information-Theoretic Basis for Protecting Secret Data from Differential Power Attacks….Pages 44-62
Key Recovery Attacks on MACs Based on Properties of Cryptographic APIs….Pages 63-72
The Exact Security of ECIES in the Generic Group Model….Pages 73-84
A New Ultrafast Stream Cipher Design: COS Ciphers….Pages 85-98
On Rabin-Type Signatures….Pages 99-113
Strong Adaptive Chosen-Ciphertext Attacks with Memory Dump (or: The Importance of the Order of Decryption and Validation)….Pages 114-127
Majority-Logic-Decodable Cyclic Arithmetic-Modular AN-Codes in 1, 2, and L Steps….Pages 128-137
Almost-Certainly Runlength-Limiting Codes….Pages 138-147
Weight vs. Magnetization Enumerator for Gallager Codes….Pages 148-157
Graph Configurations and Decoding Performance….Pages 158-165
A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing….Pages 166-175
The Synthesis of TD-Sequences and Their Application to Multi-functional Communication Systems….Pages 176-190
Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces….Pages 191-204
Statistical Properties of Digital Piecewise Linear Chaotic Maps and Their Roles in Cryptography and Pseudo-Random Coding….Pages 205-221
The Wide Trail Design Strategy….Pages 222-238
Undetachable Threshold Signatures….Pages 239-244
Improving Divide and Conquer Attacks against Cryptosystems by Better Error Detection / Correction Strategies….Pages 245-267
Key Recovery Scheme Interoperability – A Protocol for Mechanism Negotiation….Pages 268-276
Unconditionally Secure Key Agreement Protocol….Pages 277-293
An Efficient Stream Cipher Alpha1 for Mobile and Wireless Devices….Pages 294-300
Investigation of Linear Codes Possessing Some Extra Properties….Pages 301-306
Statistical Physics of Low Density Parity Check Error Correcting Codes….Pages 307-316
Generating Large Instances of the Gong-Harn Cryptosystem….Pages 317-328
Lattice Attacks on RSA-Encrypted IP and TCP….Pages 329-338
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement….Pages 339-354
Attacking the Affine Parts of SFLASH….Pages 355-359
An Identity Based Encryption Scheme Based on Quadratic Residues….Pages 360-363
Another Way of Doing RSA Cryptography in Hardware….Pages 364-373
Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA Do Not Have the SAC or Do Not Generate Random Numbers….Pages 374-377
A New Search Pattern in Multiple Residue Method (MRM) and Its Importance in the Cryptanalysis of the RSA….Pages 378-386
A New Undeniable Signature Scheme Using Smart Cards….Pages 387-394
Non-binary Block Inseparable Errors Control Codes….Pages 395-401
Cryptanalysis of Nonlinear Filter Generators with (0, 1)-Metric Viterbi Decoding….Pages 402-414