scientific article; zbMATH DE number 426131

MaRDI QIDQ3136951zbMATH OpenFDO

Authors Josef Pieprzyk

Publication date 23 January 1995

zbMATH Keywords

bent functionbent permutationBoolean functionfinite fieldHamming distance

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Bent functions from nonlinear permutations and conversely
• Further constructions of infinite families of bent functions from new permutations and their duals
• On ``bent functions
• Further investigations on permutation based constructions of bent functions
• Bent polynomials over finite fields

Cited in

(18)

• Generating bent sequences
• On ``bent functions
• Improving the strict avalanche characteristics of cryptographic functions
• A note on polynomials of the form \(x^ d+a_ ex^ e+\cdots +a_ 1x+a_ 0\) over finite fields
• Bent and permutational properties of Budaghyan-Carlet hexanomials
• Homogeneous bent functions
• More permutations and involutions for constructing bent functions
• Several new classes of self-dual bent functions derived from involutions
• Further constructions of infinite families of bent functions from new permutations and their duals
• Functional circuits defining families of permutations of the space \(\mathrm{GF}(2)^n\)
• Bent polynomials over finite fields
• On the coefficients of binary bent functions
• Crooked functions
• Construction of binary bent functions by FFT-like permutation algorithms
• scientific article; zbMATH DE number 4195885 (Why is no real title available?)
• Further investigations on permutation based constructions of bent functions
• Towards the Structure of a Class of Permutation Matrices Associated with Bent Functions
• Efficient construction of permutations of high nonlinearity

This page was built for publication:

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