CLC2006 - Workshop on Codes and Lattices in Cryptography
25. - 27. September 2006
Technische Universität Darmstadt

CLC2006 - A workshop on the bridge between error-correcting codes and Euclidean lattices and their use in cryptography and cryptanalysis.
Johannes Buchmann
Alexander May
Ulrich Vollmer

Code-based systems belong to the most promising candidates for post-quantum cryptography. They are highly efficient. By easing the constraints on storage capacity for key material, technological progress has paved the way for their practical deployment. Yet, do we feel certain enough of their security to recommend wide-spread adoption?

While the last 25 years since the first proposal of such a system by R.J.McEliece have seen a steady stream of research into their security, this effort pales in comparison to the scrutiny devoted to currently deployed systems like RSA and ECC.

Efficient lattice reduction algorithms have been very potent tools of cryptanalysis of many public-key cryptosystems. Applied to code-based systems this tool has turned out to be a very blunt one since the lift of cryptographically useful error-correcting codes yields lattices of intractably high dimensions with an abundance of short vectors.

Yet, the question still remains open whether there is more than the surface parallelism between, say, the decoding problem and the closest vector problem in a lattice, whether cross-fertilization between the research into the security of code- and lattice-based cryptosystems is possible.

This small workshop undertakes an exploration of this question and hopes to stimulate the dialogue between researchers of both communities. The topics are

  • Attacks on code- or lattice-based systems
  • Hardness of underlying problems, weak instances
  • The link between Decoding, Learning and Closest Vector Problems
  • Average versus Worst Case Complexity
  • Indistinguishability of hidden-trap door and random instances
  • Security proofs of code-based systems
  • Lattice reduction for cryptanalysis
  • Lattice reduction algorithms, including their sensitivity to properties of the instances they are applied to

Contributions to the workshop are solicited by invitation only. Travel and lodging costs for the invited speakers are covered by the workshop organizers.

In order to encourage the presentation of work-in-progress and contributions of survey character, all research presented may be published elsewhere. However, we kindly request that participants submit a three-page summary of their contribution for inclusion in the pre-proceedings. There will be opportunity for revision and enlargement in view of the results of the workshop. Post-proceedings will be made available to the cryptographic community from the document server of the hosting department.

The organizers gratefully acknowledge the generous support of the Federal Office for Information Security (BSI) .

Confirmed Speakers:
  • Thierry Berger (Universite de Limoges, France)
  • Johannes Blömer (Universität Paderborn, Germany)
  • Nicolas T. Courtois (Axalto, France)
  • Matthieu Finiasz (EPFL, Switzerland)
  • Philipe Gaborit (Universite de Limoges, France)
  • Venkatesan Guruswami (University of Washington, USA)
  • Kazukuni Kobara (University of Tokyo, Japan)
  • Pierre Loidreau (ENSTA, France)
  • Alexander May (TU Darmstadt, Germany)
  • Daniele Micciancio (University of California, San Diego)
  • Oded Regev (Tel-Aviv University, Israel)
  • Claus-Peter Schnorr (Universität Frankfurt, Germany)
  • Nicolas Sendrier (INRIA, France)

Drucker  Imprint