Designing Efficient Dyadic Operations for Cryptographic Applications
Published in In *MathCrypt 2018*, 2018
This paper presents optimized techniques for performing operations on dyadic matrices, which are symmetric and structured matrices appearing in the automorphism groups of certain linear codes.
Applications:
- Improves efficiency in code-based cryptosystems
- Supports compact key representations used in schemes like DAGS
- Offers general-purpose tools for manipulating quasi-dyadic structures in cryptographic contexts
These techniques contribute to ongoing efforts in post-quantum standardization and practical cryptographic implementations.
Recommended citation: Gustavo Banegas, Paulo S. L. M. Barreto, Edoardo Persichetti, Paolo Santini. (2018). "Designing Efficient Dyadic Operations for Cryptographic Applications." In MathCrypt 2018.
Download Paper | Download Slides | Download Bibtex