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
id doaj-500fba8fc29744f884cf71ffa4245688
record_format Article
spelling doaj-500fba8fc29744f884cf71ffa42456882021-09-06T19:40:44ZengDe GruyterJournal of Mathematical Cryptology1862-29761862-29842020-06-011419510910.1515/jmc-2015-0054jmc-2015-0054Designing Efficient Dyadic Operations for Cryptographic ApplicationsBanegas Gustavo0Barreto Paulo S. L. M.1Persichetti Edoardo2Santini Paolo3Technische Universiteit Eindhoven, Eindhoven, NetherlandsInstitute of Technology, University of Washington at Tacoma, Tacoma, United States of AmericaDepartment of Mathematical Sciences, Florida Atlantic University, Boca Raton, United States of AmericaUniversità Politecnica delle Marche, Ancona, ItalyCryptographic 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.https://doi.org/10.1515/jmc-2015-0054post-quantum cryptographycode-based cryptographydyadic matrices11t7194a60
collection DOAJ
language English
format Article
sources DOAJ
author Banegas Gustavo
Barreto Paulo S. L. M.
Persichetti Edoardo
Santini Paolo
spellingShingle Banegas Gustavo
Barreto Paulo S. L. M.
Persichetti Edoardo
Santini Paolo
Designing Efficient Dyadic Operations for Cryptographic Applications
Journal of Mathematical Cryptology
post-quantum cryptography
code-based cryptography
dyadic matrices
11t71
94a60
author_facet Banegas Gustavo
Barreto Paulo S. L. M.
Persichetti Edoardo
Santini Paolo
author_sort Banegas Gustavo
title Designing Efficient Dyadic Operations for Cryptographic Applications
title_short Designing Efficient Dyadic Operations for Cryptographic Applications
title_full Designing Efficient Dyadic Operations for Cryptographic Applications
title_fullStr Designing Efficient Dyadic Operations for Cryptographic Applications
title_full_unstemmed Designing Efficient Dyadic Operations for Cryptographic Applications
title_sort designing efficient dyadic operations for cryptographic applications
publisher De Gruyter
series Journal of Mathematical Cryptology
issn 1862-2976
1862-2984
publishDate 2020-06-01
description 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.
topic post-quantum cryptography
code-based cryptography
dyadic matrices
11t71
94a60
url https://doi.org/10.1515/jmc-2015-0054
work_keys_str_mv AT banegasgustavo designingefficientdyadicoperationsforcryptographicapplications
AT barretopauloslm designingefficientdyadicoperationsforcryptographicapplications
AT persichettiedoardo designingefficientdyadicoperationsforcryptographicapplications
AT santinipaolo designingefficientdyadicoperationsforcryptographicapplications
_version_ 1717767895165960192

Similar Items