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...
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: | |
Online Access: | https://doi.org/10.1515/jmc-2015-0054 |
Similar Items
-
Reproducible families of codes and cryptographic applications
by: Santini Paolo, et al.
Published: (2021-09-01) -
DAGS: Key encapsulation using dyadic GS codes
by: Banegas Gustavo, et al.
Published: (2018-12-01) -
Estimation of the hardness of the learning with errors problem with a restricted number of samples
by: Bindel Nina, et al.
Published: (2019-03-01) -
Efficient One-Time Signatures from Quasi-Cyclic Codes: A Full Treatment
by: Edoardo Persichetti
Published: (2018-10-01) -
On the concrete hardness of Learning with Errors
by: Albrecht Martin R., et al.
Published: (2015-10-01)