Nilpotent linearized polynomials over finite fields, revisited

DOI10.1016/J.FFA.2024.102442zbMATH Open1547.11135MaRDI QIDQ6565501

Daniel Panario, Lucas Reis

Publication date: 2 July 2024

Published in: Finite Fields and their Applications (Search for Journal in Brave)

zbMATH Keywords

permutation polynomialslinearized polynomialsïnvolutionsnilpotent linearized polynomials

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Reflection ciphers
• A note on linearized polynomials and the dimension of their kernels
• Construction of self-dual normal bases and their complexity
• Differential cryptanalysis of DES-like cryptosystems
• Permutation polynomials and applications to coding theory
• Nilpotent linearized polynomials over finite fields and applications
• Fixed points of rational functions satisfying the Carlitz property
• Permutation polynomials over finite fields -- a survey of recent advances
• Handbook of finite fields
• Involutions Over the Galois Field
• Self-Complementary Normal Bases in Finite Fields
• Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields
• PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
• Fast Software Encryption

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)