Differentially uniform mappings for cryptography
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
On almost perfect nonlinear permutations
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Almost perfect nonlinear power functions on GF (2n): the Niho case
Information and Computation
Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems
Designs, Codes and Cryptography
SIAM Journal on Discrete Mathematics
Hyperplane Sections of Fermat Varieties in P3 in Char.2 and Some Applications to Cyclic Codes
AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A New Characterization of Almost Bent Functions
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
A Construction of Differentially 4-Uniform Functions from Commutative Semifields of Characteristic 2
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Almost perfect nonlinear power functions on GF(2n): the Welch case
IEEE Transactions on Information Theory
Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
IEEE Transactions on Information Theory
A new APN function which is not equivalent to a power mapping
IEEE Transactions on Information Theory
New classes of almost bent and almost perfect nonlinear polynomials
IEEE Transactions on Information Theory
Two Classes of Quadratic APN Binomials Inequivalent to Power Functions
IEEE Transactions on Information Theory
A Proof of the Welch and Niho Conjectures on Cross-Correlations of Binary m-Sequences
Finite Fields and Their Applications
EA and CCZ Equivalence of Functions over GF(2n)
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
On Cryptographically Significant Mappings over GF(2n)
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
Some results concerning cryptographically significant mappings over GF(2n)
Designs, Codes and Cryptography
On EA-equivalence of certain permutations to power mappings
Designs, Codes and Cryptography
On known and new differentially uniform functions
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Constructing new APN functions from known ones
Finite Fields and Their Applications
| Hi-index | 0.00 |
In 2005 Budaghyan, Carlet and Pott constructed the first APN polynomials EA-inequivalent to power functions by applying CCZ-equivalence to the Gold APN functions. It is a natural question whether it is possible to construct APN polynomials EA-inequivalent to power functions by using only EA-equivalence and inverse transformation on a power APN mapping: this would be the simplest method to construct APN polynomials EA-inequivalent to power functions. In the present paper we prove that the answer to this question is positive. By this method we construct a class of APN polynomials EA-inequivalent to power functions. On the other hand it is shown that the APN polynomials constructed by Budaghyan, Carlet and Pott cannot be obtained by the introduced method.