Designing Efficient Dyadic Operations for Cryptographic Applications

Gustavo Banegas, Paulo S. L. M. Barreto, Edoardo Persichetti, Paolo Santini
2020 Journal of Mathematical Cryptology  
AbstractCryptographic 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
more » ... unctionality, called DAGS, makes use of quasi-dyadic matrices to provide compact keys for the scheme.
doi:10.1515/jmc-2015-0054 fatcat:so456wffuvbino5cdtulti4e5u