Designing efficient dyadic operations for cryptographic applications

DOI10.1515/jmc-2015-0054zbMath1441.94069OpenAlexW3038618267WikidataQ114845842 ScholiaQ114845842MaRDI QIDQ2191206

Gustavo Banegas, Paulo S. L. M. Barreto, Edoardo Persichetti, Paolo Maria Santíni

Publication date: 24 June 2020

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2015-0054

zbMATH Keywords

code-based cryptographypost-quantum cryptographydyadic matrices

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (2)

Software implementation of a code-based key encapsulation mechanism from binary QD generalized Srivastava codes ⋮ Reproducible families of codes and cryptographic applications

Uses Software

• McEliece

Cites Work

• A modular analysis of the Fujisaki-Okamoto transformation
• DAGS: key encapsulation using dyadic GS codes
• Efficient Implementation of a CCA2-Secure Variant of McEliece Using Generalized Srivastava Codes
• Compact McEliece Keys from Goppa Codes
• On the inherent intractability of certain coding problems (Corresp.)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Triangular Factorization and Inversion by Fast Matrix Multiplication
• Compact McEliece keys based on quasi-dyadic Srivastava codes

This page was built for publication: Designing efficient dyadic operations for cryptographic applications