An algorithm for finding the minimum degree of a polynomial over a finite field for a function over a vector space depending on the choice of an irreducible polynomial

DOI10.17223/20710410/43/1zbMath1466.12001OpenAlexW2939076229MaRDI QIDQ5151251

S. A. Belov

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm649

zbMATH Keywords

finite fieldBoolean functionsblock cipherirreducible polynomial

Mathematics Subject Classification ID

Cryptography (94A60) Computational methods for problems pertaining to field theory (12-08) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Uses Software

• PRESENT
• ICEBERG
• Serpent

Cites Work

• PRESENT: An Ultra-Lightweight Block Cipher
• The interpolation attack on block ciphers
• Serpent: A New Block Cipher Proposal
• Fast Software Encryption
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for finding the minimum degree of a polynomial over a finite field for a function over a vector space depending on the choice of an irreducible polynomial