Paper 2018/666

Reproducible Families of Codes and Cryptographic Applications

Paolo Santini, Edoardo Persichetti, and Marco Baldi

Abstract

In this paper we study structured linear block codes, starting from well known examples and generalizing them to a wide class of codes that we call reproducible codes. These codes have the property that can be entirely generated from a small number of signature vectors, and consequently admit matrices that can be described in a very compact way. We then show some cryptographic applications of this class of codes and explain why the general framework we introduce may pave the way for future developments of code-based cryptography based on structured codes.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Minor revision.Journal of Mathematical Cryptology
Contact author(s)
epersichetti @ fau edu
History
2021-09-09: last of 4 revisions
2018-07-13: received
See all versions
Short URL
https://ia.cr/2018/666
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2018/666,
      author = {Paolo Santini and Edoardo Persichetti and Marco Baldi},
      title = {Reproducible Families of Codes and Cryptographic Applications},
      howpublished = {Cryptology ePrint Archive, Paper 2018/666},
      year = {2018},
      note = {\url{https://eprint.iacr.org/2018/666}},
      url = {https://eprint.iacr.org/2018/666}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.