Designing Efficient Dyadic Operations for Cryptographic Applications

Gustavo Banegas; Paulo S.L.M. Barreto; Edoardo Persichetti; Paolo Santini

doi:10.1515/jmc-2015-0054

Designing Efficient Dyadic Operations for Cryptographic Applications

Gustavo Banegas (Corresponding author)
, Paulo S.L.M. Barreto
, Edoardo Persichetti
, Paolo Santini

Coding Theory and Cryptology

Research output: Contribution to journal › Article › Academic › peer-review

6 Citations (Scopus)

70 Downloads (Pure)

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.

Original language	English
Pages (from-to)	95-109
Number of pages	15
Journal	Journal of Mathematical Cryptology
Volume	14
Issue number	1
DOIs	https://doi.org/10.1515/jmc-2015-0054
Publication status	Published - 1 Jan 2020

Bibliographical note

Funding Information:
Edoardo Persichetti and Paolo Santini were supported by NSF grant CNS-1906360.

Publisher Copyright:
© 2020 G. Banegas et al., published by De Gruyter 2020.

Funding

Edoardo Persichetti and Paolo Santini were supported by NSF grant CNS-1906360.

Funders	Funder number
National Science Foundation	CNS-1906360
European Union's Horizon 2020 - Research and Innovation Framework Programme	643161

Keywords

code-based cryptography
dyadic matrices
post-quantum cryptography

Access to Document

10.1515/jmc-2015-0054

published versionFinal published version, 556 KB

Cite this

@article{44ef4206a86b47c8a30d659adc287d6f,

title = "Designing Efficient Dyadic Operations for Cryptographic Applications",

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

keywords = "code-based cryptography, dyadic matrices, post-quantum cryptography",

author = "Gustavo Banegas and Barreto, \{Paulo S.L.M.\} and Edoardo Persichetti and Paolo Santini",

note = "Funding Information: Edoardo Persichetti and Paolo Santini were supported by NSF grant CNS-1906360. Publisher Copyright: {\textcopyright} 2020 G. Banegas et al., published by De Gruyter 2020.",

year = "2020",

month = jan,

day = "1",

doi = "10.1515/jmc-2015-0054",

language = "English",

volume = "14",

pages = "95--109",

journal = "Journal of Mathematical Cryptology",

issn = "1862-2976",

publisher = "Walter de Gruyter GmbH",

number = "1",

}

TY - JOUR

T1 - Designing Efficient Dyadic Operations for Cryptographic Applications

AU - Banegas, Gustavo

AU - Barreto, Paulo S.L.M.

AU - Persichetti, Edoardo

AU - Santini, Paolo

PY - 2020/1/1

Y1 - 2020/1/1

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

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

KW - code-based cryptography

KW - dyadic matrices

KW - post-quantum cryptography

UR - https://www.scopus.com/pages/publications/85087025032

U2 - 10.1515/jmc-2015-0054

DO - 10.1515/jmc-2015-0054

M3 - Article

AN - SCOPUS:85087025032

SN - 1862-2976

VL - 14

SP - 95

EP - 109

JO - Journal of Mathematical Cryptology

JF - Journal of Mathematical Cryptology

IS - 1

ER -

Designing Efficient Dyadic Operations for Cryptographic Applications

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this