[Resource Topic] 2018/650: Designing Efficient Dyadic Operations for Cryptographic Applications

Welcome to the resource topic for 2018/650

Designing Efficient Dyadic Operations for Cryptographic Applications

Authors: Gustavo Banegas, Paulo S. L. M. Barreto, Edoardo Persichetti, Paolo Santini


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.

ePrint: https://eprint.iacr.org/2018/650

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .