Designing Efficient Dyadic Operations for Cryptographic Applications

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.