Nilpotent linearized polynomials over finite fields, revisited
From MaRDI portal
Publication:6565501
Recommendations
Cites work
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 4023423 (Why is no real title available?)
- A note on linearized polynomials and the dimension of their kernels
- Analysis of involutional ciphers: Khazad and Anubis.
- Construction of self-dual normal bases and their complexity
- Differential cryptanalysis of DES-like cryptosystems
- Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields
- Fixed points of rational functions satisfying the Carlitz property
- Handbook of finite fields
- Involutions Over the Galois Field
- Nilpotent linearized polynomials over finite fields and applications
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- Permutation polynomials and applications to coding theory
- Permutation polynomials over finite fields -- a survey of recent advances
- Reflection ciphers
- Self-Complementary Normal Bases in Finite Fields
This page was built for publication: Nilpotent linearized polynomials over finite fields, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565501)