Differentially uniform mappings for cryptography
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
The Design of Rijndael
Essential Algebraic Structure within the AES
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Affinity of permutations of F2n
Discrete Applied Mathematics - Special issue: Coding and cryptography
Efficient algorithms for solving overdefined systems of multivariate polynomial equations
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Higher order correlation attacks, XL algorithm and cryptanalysis of Toyocrypt
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Using wiedemann's algorithm to compute the immunity against algebraic and fast algebraic attacks
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Efficient computation of algebraic immunity for algebraic and fast algebraic attacks
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
On exact algebraic [non-]immunity of s-boxes based on power functions
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Almost perfect nonlinear power functions on GF(2n): the Welch case
IEEE Transactions on Information Theory
New classes of almost bent and almost perfect nonlinear polynomials
IEEE Transactions on Information Theory
On EA-equivalence of certain permutations to power mappings
Designs, Codes and Cryptography
Permutation polynomials EA-equivalent to the inverse function over GF (2n)
Cryptography and Communications
| Hi-index | 0.00 |
In this paper we investigate the algebraic properties of important cryptographic primitives called substitution boxes (S-boxes). An S-box is a mapping that takes nbinary inputs whose image is a binary m-tuple; therefore it is represented as $F:\text{GF}(2)^n \rightarrow \text{GF}(2)^m$. One of the most important cryptographic applications is the case n= m, thus the S-box may be viewed as a function over $\text{GF}(2^n)$. We show that certain classes of functions over $\text{GF}(2^n)$ do not possess a cryptographic property known as APN (Almost Perfect Nonlinear) permutations. On the other hand, when nis odd, an infinite class of APN permutations may be derived in a recursive manner, that is starting with a specific APN permutation on $\text{GF}(2^k)$, kodd, APN permutations are derived over $\text{GF}(2^{k+2i})$ for any i茂戮驴 1. Some theoretical results related to permutation polynomials and algebraic properties of the functions in the ring $\text{GF}(q)[x,y]$ are also presented. For sparse polynomials over the field $\text{GF}(2^n)$, an efficient algorithm for finding low degree I/O equations is proposed.