Cryptology ePrint Archive: Report 2018/650

Designing Efficient Dyadic Operations for Cryptographic Applications

Gustavo Banegas and Paulo S. L. M. Barreto and Edoardo Persichetti and Paolo Santini

Abstract: Cryptographic primitives from coding theory are some of the most promising candidates for NIST's Post-Quantum Cryptography Standardization process. In this paper, we introduce a variety of techniques to improve operations on dyadic matrices, a particular type of symmetric matrices that appear in the automorphism group of certain linear codes. Besides the independent interest, these techniques find an immediate application in practice. In fact, one of the candidates for the Key Exchange functionality, called DAGS, makes use of quasi-dyadic matrices to provide compact keys for the scheme.

Category / Keywords: public-key cryptography / code-based, dyadic

Date: received 5 Jul 2018

Contact author: epersichetti at fau edu

Available format(s): PDF | BibTeX Citation

Version: 20180706:130006 (All versions of this report)

Short URL: ia.cr/2018/650

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]