Designing Efficient Dyadic Operations for Cryptographic Applications

Designing Efficient Dyadic Operations for Cryptographic Applications

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...

Full description

Bibliographic Details
Main Authors: Banegas Gustavo, Barreto Paulo S. L. M., Persichetti Edoardo, Santini Paolo
Format: Article
Language:English
Published: De Gruyter 2020-06-01
Series:Journal of Mathematical Cryptology
Subjects:
post-quantum cryptography
code-based cryptography
dyadic matrices
11t71
94a60
Online Access:https://doi.org/10.1515/jmc-2015-0054
Description
Summary: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.
ISSN:1862-2976
1862-2984

Similar Items