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. © 2020 G. Banegas et al., published by De Gruyter 2020.
Designing Efficient Dyadic Operations for Cryptographic Applications / Banegas, G.; Barreto, P. S. L. M.; Persichetti, E.; Santini, P.. - In: JOURNAL OF MATHEMATICAL CRYPTOLOGY. - ISSN 1862-2976. - 14:1(2020), pp. 95-109. [10.1515/jmc-2015-0054]
Designing Efficient Dyadic Operations for Cryptographic Applications
Persichetti, E.;Santini, P.
2020-01-01
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. © 2020 G. Banegas et al., published by De Gruyter 2020.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
