Cryptology ePrint Archive: Report 2018/666

Reproducible Families of Codes and Cryptographic Applications

Paolo Santini and 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.

Category / Keywords:

Original Publication (with minor differences): Journal of Mathematical Cryptology

Date: received 9 Jul 2018, last revised 9 Sep 2021

Contact author: epersichetti at fau edu

Available format(s): PDF | BibTeX Citation

Version: 20210909:143616 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]