Coding and Cryptography

1. Front Matter

   PDF

2. Second Support Weights for Binary Self-dual Codes

   • Keisuke Shiromoto

   Pages 1-13

3. On Codes Correcting Symmetric Rank Errors

   • Nina I. Pilipchuk, Ernst M. Gabidulin

   Pages 14-21

4. Error and Erasure Correction of Interleaved Reed–Solomon Codes

   • Georg Schmidt, Vladimir R. Sidorenko, Martin Bossert

   Pages 22-35

5. A Welch–Berlekamp Like Algorithm for Decoding Gabidulin Codes

   • Pierre Loidreau

   Pages 36-45

6. On the Weights of Binary Irreducible Cyclic Codes

   • Yves Aubry, Philippe Langevin

   Pages 46-54

7. 3-Designs from Z ₄-Goethals-Like Codes and Variants of Cyclotomic Polynomials

   • Jyrki Lahtonen, Kalle Ranto, Roope Vehkalahti

   Pages 55-68

8. Space-Time Code Designs Based on the Generalized Binary Rank Criterion with Applications to Cooperative Diversity

   • A. Roger Hammons Jr.

   Pages 69-84

9. Geometric Conditions for the Extendability of Ternary Linear Codes

   • Tatsuya Maruta, Kei Okamoto

   Pages 85-99

10. On the Design of Codes for DNA Computing

    • Olgica Milenkovic, Navin Kashyap

    Pages 100-119

11. Open Problems Related to Algebraic Attacks on Stream Ciphers

    • Anne Canteaut

    Pages 120-134

12. On the Non-linearity and Sparsity of Boolean Functions Related to the Discrete Logarithm in Finite Fields of Characteristic Two

    • Nina Brandstätter, Tanja Lange, Arne Winterhof

    Pages 135-143

13. Interpolation of Functions Related to the Integer Factoring Problem

    • Clemens Adelmann, Arne Winterhof

    Pages 144-154

14. On Degrees of Polynomial Interpolations Related to Elliptic Curve Cryptography

    • Takakazu Satoh

    Pages 155-163

15. Finding Good Differential Patterns for Attacks on SHA-1

    • Krystian Matusiewicz, Josef Pieprzyk

    Pages 164-177

16. Extending Gibson’s Attacks on the GPT Cryptosystem

    • Raphael Overbeck

    Pages 178-188

17. Reduction of Conjugacy Problem in Braid Groups, Using Two Garside Structures

    • Maffre Samuel

    Pages 189-201

18. A New Key Assignment Scheme for Access Control in a Complete Tree Hierarchy

    • Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci

    Pages 202-217

19. Multi-Dimensional Hash Chains and Application to Micropayment Schemes

    • Quan Son Nguyen

    Pages 218-228

20. On the Affine Transformations of HFE-Cryptosystems and Systems with Branches

    • Patrick Felke

    Pages 229-241

Thisvolumecontainsrefereedpapersdevotedtocodingandcryptography.These papers arethe full versionsof a selectionof the best extended abstractsaccepted for presentation at the International Workshop on Coding and Cryptography (WCC 2005) held in Bergen, Norway, March 14–18, 2005. Each of the 118 - tended abstracts originallysubmitted to the workshop were reviewed by at least two members of the Program Committee. As a result of this screening process, 58 papers were selected for presentation, of which 52 were eventually presented at the workshop together with four invited talks. The authors of the presented papers were in turn invited to submit full v- sions of their papers to the full proceedings. Each of the full-version submissions were once again thoroughly examined and commented upon by at least two reviewers. This volume is the end result of this long process. I am grateful to the reviewers who contributed to guaranteeing the high standards of this volume, and who are named on the next pages. It was a pl- sure for me to work with my program co-chair Pascale Charpin, whose expe- enced advice I havefurther bene?ted greatly from during the preparationof this ´ volume. Discussions with Tor Helleseth and Angela Barbero were also useful in putting the volume together. Finally, I would like to thank all the authors and all the other participants of the WCC 2005 for making it in every sense a highly enjoyable event.

• Code
• Elliptic Curve Cryptography
• Error-correcting Code
• Time Hopping
• access control
• authentication
• coding
• coding theory
• cryptanalysis
• cryptography
• cryptology
• cryptosystems
• decoding
• error-correcting codes
• finite field

• Dept. of Informatics, University of Bergen, Bergen, Norway

  Øyvind Ytrehus

Policies and ethics