Algorithms for computing the permutation resemblance of functions over finite groups

DOI10.1090/MCOM/3996MaRDI QIDQ7027568zbMATH OpenFDO

Authors Li-An Chen, Robert S. Coulter

Publication date 14 February 2025

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/MCOM/3996

zbMATH Keywords

integer programmingdifferential uniformitypermutation polynomialspermutation resemblance

Mathematics Subject Classification ID

Integer programming (90C10) Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite fields (field-theoretic aspects) (12E20) Special polynomials in general fields (12E10)

Cites work

• scientific article; zbMATH DE number 5831605 (Why is no real title available?)
• scientific article; zbMATH DE number 1394295 (Why is no real title available?)
• A class of functions and their application in constructing semi-biplanes and association schemes
• Applied integer programming. Modeling and solution.
• Commutative presemifields and semifields
• Differential cryptanalysis of DES-like cryptosystems
• On the number of distinct values of a class of functions over a finite field
• On the number of distinct values of a class of functions with finite domain
• Permutation resemblance
• Planes of order n with collineation groups of order n^ 2
• Pseudo-Paley graphs and skew Hadamard difference sets from presemifields
• Some Theorems on Planar Mappings
• The Magma algebra system. I: The user language

This page was built for publication: Algorithms for computing the permutation resemblance of functions over finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027568)