### Designing Efficient Dyadic Operations for Cryptographic Applications

Gustavo Banegas, Paulo S. L. M. Barreto, 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.

Available format(s)
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
Contact author(s)
epersichetti @ fau edu
History
Short URL
https://ia.cr/2018/650

CC BY

BibTeX

@misc{cryptoeprint:2018/650,
author = {Gustavo Banegas and Paulo S.  L.  M.  Barreto and Edoardo Persichetti and Paolo Santini},
title = {Designing Efficient Dyadic Operations for Cryptographic Applications},
howpublished = {Cryptology ePrint Archive, Paper 2018/650},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/650}},
url = {https://eprint.iacr.org/2018/650}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.