An algebraic approach to symmetric linear layers in cryptographic primitives
From MaRDI portal
Publication:6088853
DOI10.1007/s12095-023-00630-wOpenAlexW4320728913MaRDI QIDQ6088853
Publication date: 14 December 2023
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-023-00630-w
Polynomials over finite fields (11T06) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Polynomials and finite commutative rings (13M10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The design of Rijndael. The Advanced Encryption Standard (AES)
- LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
- Proving resistance against invariant attacks: how to choose the round constants
- Chinese remainder theorem for cyclotomic polynomials in \(\mathbb Z[X\)]
- On Circulant Matrices
This page was built for publication: An algebraic approach to symmetric linear layers in cryptographic primitives
