Cryptography and Coding

1. Front Matter

   Pages I-IX

   PDF

2. A Statistical Decoding Algorithm for General Linear Block Codes

   • A. Al Jabri

   Pages 1-8

3. On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory

   • Christoph Lange, Andreas Ahrens

   Pages 9-19

4. The Complete Weight Enumerator for Codes over M _nxs(F _q)

   • Irfan Siap

   Pages 20-26

5. Further Improvement of Kumar-Rajagopalan-Sahai Coding Constructions for Blacklisting Problem

   • Maki Yoshida, Toru Fujiwara

   Pages 27-37

6. A Simple Soft-Input/Soft-Output Decoder for Hamming Codes

   • Simon Hirst, Bahram Honary

   Pages 38-43

7. A Technique with an Information-Theoretic Basis for Protecting Secret Data from Differential Power Attacks

   • Manfred von Willich

   Pages 44-62

8. Key Recovery Attacks on MACs Based on Properties of Cryptographic APIs

   • Karl Brincat, Chris J. Mitchell

   Pages 63-72

9. The Exact Security of ECIES in the Generic Group Model

   • N. P. Smart

   Pages 73-84

10. A New Ultrafast Stream Cipher Design: COS Ciphers

    • Eric Filiol, Caroline Fontaine

    Pages 85-98

11. On Rabin-Type Signatures

    • Marc Joye, Jean-Jacques Quisquater

    Pages 99-113

12. Strong Adaptive Chosen-Ciphertext Attacks with Memory Dump (or: The Importance of the Order of Decryption and Validation)

    • Seungjoo Kim, Jung Hee Cheon, Marc Joye, Seongan Lim, Masahiro Mambo, Dongho Won et al.

    Pages 114-127

13. Majority-Logic-Decodable Cyclic Arithmetic-Modular AN-Codes in 1, 2, and L Steps

    • F. Javier Galán-Simón, Edgar Martínez-Moro, Juan G. Tena-Ayuso

    Pages 128-137

14. Almost-Certainly Runlength-Limiting Codes

    • David J. C. MacKay

    Pages 138-147

15. Weight vs. Magnetization Enumerator for Gallager Codes

    • Jort van Mourik, David Saad, Yoshiyuki Kabashima

    Pages 148-157

16. Graph Configurations and Decoding Performance

    • J. T. Paire, P. Coulton, P. G. Farrell

    Pages 158-165

17. A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing

    • P. Benachour, P. G. Farrell, Bahram Honary

    Pages 166-175

18. The Synthesis of TD-Sequences and Their Application to Multi-functional Communication Systems

    • Ahmed Al-Dabbagh, Michael Darnell

    Pages 176-190

19. Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces

    • Svetla Nikova, Ventzislav Nikov

    Pages 191-204

20. Statistical Properties of Digital Piecewise Linear Chaotic Maps and Their Roles in Cryptography and Pseudo-Random Coding

    • Shujun Li, Qi Li, Wenmin Li, Xuanqin Mou, Yuanlong Cai

    Pages 205-221

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.

• DES
• algorithms
• coding
• communication
• crypto-system-design
• cryptography
• decoding algorithms
• digital signatures
• error-correcting code
• error-correcting codes
• finite field computations
• information security
• random numbers
• secure communications
• statistical decoding

• Faculty of Applied Sciences, Department of Communication Systems, Lancaster University, Lancaster, UK

  Bahram Honary

Policies and ethics