Differential and Linear Cryptanalysis of Reduced-Round Simon, IACR Cryptology ePrint Archive, p.526, 2013. ,
Differential Cryptanalysis of Round-Reduced Simon and Speck, FSE 2014, 2014. ,
DOI : 10.1007/978-3-662-46706-0_27
Lauridsen : Cryptanalysis of the SIMON Family of Block Ciphers, IACR Cryptology ePrint Archive, p.543, 2013. ,
Junko Nakajima et Toshio Tokita : Camellia : A 128-Bit Block Cipher Suitable for Multiple Platforms -Design and Analysis, Stinson et Tavares [188], pp.39-56 ,
Information Security Theory and Practice. Security, Privacy and Trust in Computing Systems and Ambient Intelligent Ecosystems -6th IFIP WG 11 ,
A few more functions that are not APN infinitely often, Contemporary Mathematics, vol.518, pp.23-31, 2010. ,
DOI : 10.1090/conm/518/10193
URL : https://hal.archives-ouvertes.fr/hal-00415755
Zero-sum distinguishers for reduced Keccak-f and for the core functions of Luffa and Hamsi, 2009. ,
Selected Areas in Cryptography, 15th International Workshop, de Lecture Notes in Computer Science, 2008. ,
Bryan Weeks et Louis Wingers : The SIMON and SPECK Families of Lightweight Block Ciphers, Cryptology ePrint Archive, vol.404, 2013. ,
Pascale Charpin et Yann Laigle-Chapuy : On Almost Perfect Nonlinear Functions Over F 2 n, IEEE Transactions on Information Theory, vol.52, issue.9, pp.4160-4170, 2006. ,
On Almost Perfect Nonlinear Permutations, Helleseth [107], pp.65-76 ,
DOI : 10.1007/3-540-48285-7_7
Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials, Stern [187], pp.12-23 ,
Differential cryptanalysis of DES-like cryptosystems, Journal of Cryptology, vol.36, issue.4, pp.3-72, 1991. ,
DOI : 10.1007/BF00630563
Fast Software Encryption, 14th International Workshop, Lecture Notes in Computer Science, vol.4593, 2007. ,
Selected Areas in Cryptography -17th International Workshop, de Lecture Notes in Computer Science, 2010. ,
La Cryptanalyse Différentielle et ses Généralisations, Thèse de doctorat, UPMC, 2011. ,
Improbable Differential from Impossible Differential: On the Validity of the Model, pp.149-160 ,
DOI : 10.1007/978-3-319-03515-4_10
Differential properties of power functions, International Journal of Information and Coding Theory, vol.1, issue.2, pp.149-170, 2010. ,
DOI : 10.1504/IJICOT.2010.032132
URL : https://hal.archives-ouvertes.fr/hal-00610114
Differential Properties of <formula formulatype="inline"> <tex Notation="TeX">${x\mapsto x^{2^{t}-1}}$</tex></formula>, IEEE Transactions on Information Theory, vol.57, issue.12, pp.8127-8137, 2011. ,
DOI : 10.1109/TIT.2011.2169129
New Links between Differential and Linear Cryptanalysis, pp.388-404 ,
DOI : 10.1007/978-3-642-38348-9_24
Differential Cryptanalysis of PUFFIN and PUFFIN2, p.2011 ,
Zero-Correlation Linear Cryptanalysis with FFT and Improved Attacks on ISO Standards Camellia and CLEFIA, Lange et al. [141], pp.306-323 ,
DOI : 10.1007/978-3-662-43414-7_16
Vikkelsoe : PRESENT : An Ultra-Lightweight Block Cipher, Paillier et Verbauwhede [171], pp.450-466 ,
Analyse de Fonctions de Hachage Cryptographiques, Thèse de doctorat ,
URL : https://hal.archives-ouvertes.fr/tel-00767028
A zero-sum property for the KECCAK-f permutation with 18 rounds, 2010 IEEE International Symposium on Information Theory, pp.2488-2492 ,
DOI : 10.1109/ISIT.2010.5513442
URL : https://hal.archives-ouvertes.fr/hal-00738232
Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256, Biryukov et al, pp.1-17 ,
DOI : 10.1007/3-540-45708-9_19
URL : https://hal.archives-ouvertes.fr/hal-00738200
On the Influence of the Algebraic Degree of <formula formulatype="inline"><tex Notation="TeX">$F^{-1}$</tex></formula> on the Algebraic Degree of <formula formulatype="inline"><tex Notation="TeX">$G \circ F$</tex> </formula>, IEEE Transactions on Information Theory, vol.59, issue.1, pp.691-702, 2013. ,
DOI : 10.1109/TIT.2012.2214203
Anne Canteaut et Christophe DeCannì ere : Higher-Order Differential Properties of Keccak and Luffa, Joux [117], pp.252-269 ,
María Naya-Plasencia et Valentin Suder : Improved Impossible Differential Attacks against Round-Reduced LBlock, IACR Cryptology ePrint Archive, p.279, 2014. ,
Scrutinizing and Improving Impossible Differentials Attacks : Applications to CLEFIA ,
DOI : 10.1007/978-3-662-45611-8_10
Scrutinizing and Improving Impossible Differential Attacks: Applications to CLEFIA, Camellia, LBlock and Simon, IACR Cryptology ePrint Archive, p.699, 2014. ,
DOI : 10.1007/978-3-662-45611-8_10
URL : https://hal.archives-ouvertes.fr/hal-01068894
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 17th International Symposium, AAECC-17 Proceedings, volume 4851 de Lecture Notes in Computer Science, 2007. ,
New families of quadratic almost perfect nonlinear trinomials and multinomials. Finite Fields and Their Applications, pp.703-714, 2008. ,
A few more quadratic APN functions, Cryptography and Communications, vol.52, issue.2, pp.43-53, 2011. ,
DOI : 10.1007/s12095-010-0038-7
On the equivalence of quadratic APN functions, Designs, Codes and Cryptography, vol.15, issue.2, pp.261-272, 2011. ,
DOI : 10.1007/s10623-010-9475-8
A Highly Nonlinear Differentially 4 Uniform Power Mapping That Permutes Fields of Even Degree. Finite Fields and Their Applications, pp.231-242, 2010. ,
Binomial differentially 4 uniform permutations with high nonlinearity. Finite Fields and Their Applications, pp.537-546, 2012. ,
DOI : 10.1016/j.ffa.2011.11.006
URL : http://dx.doi.org/10.1016/j.ffa.2011.11.006
Advances in Cryptology -CRYPTO '92, 12th Annual International Cryptology Conference Proceedings, volume 740 de Lecture Notes in Computer Science, 1992. ,
DOI : 10.1007/3-540-48071-4
McQuistan : APN polynomials and related codes, Special Volume of Journal of Combinatorics, Information and System Sciences, honoring the 75-th birthday of Prof. D.K.Ray- Chaudhuri, 2008. ,
An APN permutation in dimension six, Finite Fields : Theory and Applications- Selected Papers from the 9th International Conference Finite Fields ans Applications. Contemporary Mathematics, pp.33-42, 2010. ,
DOI : 10.1090/conm/518/10194
Two Classes of Quadratic APN Binomials Inequivalent to Power Functions, IEEE Transactions on Information Theory, vol.54, issue.9, pp.4218-4229, 2008. ,
DOI : 10.1109/TIT.2008.928275
Constructing new APN functions from known ones. Finite Fields and Their Applications, pp.150-159, 2009. ,
DOI : 10.1016/j.ffa.2008.10.001
URL : http://doi.org/10.1016/j.ffa.2008.10.001
New classes of almost bent and almost perfect nonlinear polynomials, IEEE Transactions on Information Theory, vol.52, issue.3, pp.1141-1152, 2006. ,
DOI : 10.1109/TIT.2005.864481
Analyse et Conception de ChiffrementsàChiffrementsà Clef Secrète, 2006. ,
Fast Software Encryption -19th International Workshop Revised Selected Papers, Lecture Notes in Computer Science, vol.7549, 2012. ,
Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions, Preneel [177], pp.507-522 ,
DOI : 10.1007/3-540-45539-6_36
On cryptographic properties of the cosets of R(1, m), IEEE Transactions on Information Theory, vol.47, issue.4, pp.1494-1513, 2001. ,
DOI : 10.1109/18.923730
Decomposing bent functions, IEEE Transactions on Information Theory, vol.49, issue.8, pp.2004-2019, 2003. ,
DOI : 10.1109/TIT.2003.814476
Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture, IEEE Transactions on Information Theory, vol.46, issue.1, pp.4-9, 2000. ,
DOI : 10.1109/18.817504
Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences, SIAM Journal on Discrete Mathematics, vol.13, issue.1, pp.105-138, 2000. ,
DOI : 10.1137/S0895480198350057
Kyureghyan : A new class of monomial bent functions. Finite Fields and Their Applications, pp.221-241, 2008. ,
Structural weaknesses of permutations with a low differential uniformity and generalized crooked functions, Contemporary Mathematics, vol.518, pp.55-71, 2010. ,
DOI : 10.1090/conm/518/10196
Boolean Functions for Cryptography and Error-Correcting Codes, Crama et Hammer [78], pp.257-397 ,
DOI : 10.1017/CBO9780511780448.011
Vectorial Boolean Functions for Cryptography, Crama et Hammer [78], pp.398-469 ,
DOI : 10.1017/CBO9780511780448.012
Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems, Designs, Codes and Cryptography, vol.15, issue.2, pp.125-156, 1998. ,
DOI : 10.1023/A:1008344232130
Arithmetic of Finite Fields, First International Workshop, WAIFI, Proceedings, volume 4547 de Lecture Notes in Computer Science, 2007. ,
APN functions of degree 4e with e ? 3(mod4) The International Workshop on Coding and Cryptography, pp.39-46, 2013. ,
Links between differential and linear cryptoanalysis, Santis [182], pp.356-365 ,
Normal Boolean functions, Journal of Complexity, vol.20, issue.2-3, pp.245-265, 2004. ,
DOI : 10.1016/j.jco.2003.08.010
On a Class of Permutation Polynomials over F 2 m, Golomb et al. [103], pp.368-376 ,
When does G(x) + ?T r(H(x)) permute F p n ? Finite Fields and Their Applications, pp.615-632, 2009. ,
Monomial functions with linear structure and permutation polynomials, Contemporary Mathematics, vol.518, pp.99-111, 2010. ,
DOI : 10.1090/conm/518/10199
A note on verifying the APN property, IACR Cryptology ePrint Archive, p.475, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00932161
Sparse Permutations with Low Differential Uniformity. Finite Fields and Their Applications, pp.214-243, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01068860
On Bent and Semi-Bent Quadratic Boolean Functions, IEEE Transactions on Information Theory, vol.51, issue.12, pp.4286-4298, 2005. ,
DOI : 10.1109/TIT.2005.858929
Finite Fields and their Applications, Character Sums and Polynomials, de RADON Series on Computanional and Applied Mathematics. De Gruyter, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00931614
Polynomials with linear structure and Maiorana-McFarland construction, ISIT [1], pp.1138-1142 ,
Polynomials With Linear Structure and Maiorana–McFarland Construction, IEEE Transactions on Information Theory, vol.57, issue.6, pp.3796-3804, 2011. ,
DOI : 10.1109/TIT.2011.2133690
Advances in Cryptology -EUROCRYPT '87, Workshop on the Theory and Application of of Cryptographic Techniques, Proceedings, volume 304 de Lecture Notes in Computer Science, 1987. ,
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 10th International Symposium, AAECC-10 Proceedings, volume 673 de Lecture Notes in Computer Science, 1993. ,
Finite Field Elements with Specified Order and Traces, Des. Codes Cryptography, vol.36, issue.3, pp.331-340, 2005. ,
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations, Zheng [220], pp.267-287 ,
DOI : 10.1007/3-540-36178-2_17
Boolean Models and Methods in Mathematics, de Encyclopedia of Mathematics and its Applications, 2010. ,
Rijndael/AES, AES Candidate Conference, pp.343-348, 2000. ,
DOI : 10.1007/0-387-23483-7_358
The Design of Rijndael : AES -The Advanced Encryption Standard. Information Security and Cryptography, 2002. ,
DOI : 10.1007/978-3-662-04722-4
Advances in Cryptology -EUROCRYPT '91, Workshop on the Theory and Application of of Cryptographic Techniques, Proceedings, volume 547 de Lecture Notes in Computer Science, 1991. ,
Elementary Hadamard Difference sets, Thèse de doctorat, 1974. ,
Geometry, codes and difference sets : exceptional connections. Codes and Designs, pp.73-85, 2000. ,
New cyclic difference sets with Singer parameters. Finite Fields and Their Applications, pp.342-389, 2004. ,
Cube Attacks on Tweakable Black Box Polynomials, Joux [116], pp.278-299 ,
DOI : 10.1007/978-3-540-68164-9_16
Almost Perfect Nonlinear Power Functions on GF(2n): The Niho Case, Information and Computation, vol.151, issue.1-2, pp.57-72, 1999. ,
DOI : 10.1006/inco.1998.2764
Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case, IEEE Transactions on Information Theory, vol.45, issue.4, pp.1271-1275, 1999. ,
DOI : 10.1109/18.761283
Another Proof of Kasami's Theorem, Designs, Codes and Cryptography, vol.17, issue.1/3, pp.177-180, 1999. ,
DOI : 10.1023/A:1026475109375
Almost Perfect Nonlinear Power Functions on GF (2 n ) : a new class for n divisible by 5. Finite Fields and Applications F q5, pp.113-121, 2000. ,
Construction of bent functions via Niho power functions, Journal of Combinatorial Theory, Series A, vol.113, issue.5, pp.779-798, 2006. ,
DOI : 10.1016/j.jcta.2005.07.009
URL : https://hal.archives-ouvertes.fr/hal-00110513
Affinity of permutations of F 2 n, Discrete Applied Mathematics, vol.154, issue.2, pp.313-325, 2006. ,
Improved Meet-in-the-Middle Attacks on Reduced-Round DES, Srinathan et al. [186], pp.86-100 ,
DOI : 10.1007/978-3-540-77026-8_8
A new APN function which is not equivalent to a power mapping, IEEE Transactions on Information Theory, vol.52, issue.2, pp.744-747, 2006. ,
DOI : 10.1109/TIT.2005.862128
A new almost perfect nonlinear function which is not quadratic, Advances in Mathematics of Communications, vol.3, issue.1, pp.59-81, 2009. ,
On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear Functions, Parker [172], pp.383-401 ,
DOI : 10.1007/978-3-642-10868-6_23
Linear Structures in Blockciphers, Chaum et Price [74], pp.249-266 ,
DOI : 10.1007/3-540-39118-5_23
Advances in Cryptology -CRYPTO '91, 11th Annual International Cryptology Conference Proceedings, volume 576 de Lecture Notes in Computer Science, 1991. ,
DOI : 10.1007/3-540-46766-1
ContributionàContribution`Contributionà la recherche de fonctions booléennes hautement non linéaires ,
Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations, Hong et Iwata [111], pp.365-383 ,
DOI : 10.1007/978-3-642-13858-4_21
Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.), IEEE Transactions on Information Theory, vol.14, issue.1, pp.154-156, 1968. ,
DOI : 10.1109/TIT.1968.1054106
Golic : On the Security of Nonlinear Filter Generators, Gollmann [102], pp.173-188 ,
Fast Software Encryption, Third International Workshop, Proceedings, volume 1039 de Lecture Notes in Computer Science, 1996. ,
Sequences and Their Applications -SETA, 5th International Conference Proceedings, volume 5203 de Lecture Notes in Computer Science, 2008. ,
When is x ?1 + L(x) a permutation in odd characteristic ?, Workshop on Coding and Cryptography, WCC 2013, 2006. ,
Halmos : Finite-Dimensional Vector Spaces. The Unversity Series in Undergraduate Mathematics. D. Van Nostrand Company, secondéditionsecondédition, 1958. ,
Advances in Cryptology -EUROCRYPT '93, Workshop on the Theory and Application of of Cryptographic Techniques, Proceedings, volume 765 de Lecture Notes in Computer Science, 1993. ,
Proof of a conjecture on the sequence of exceptional numbers, classifying cyclic codes and APN functions, Journal of Algebra, vol.343, issue.1, pp.78-92, 2011. ,
DOI : 10.1016/j.jalgebra.2011.06.019
Two results on maximum nonlinear functions, Designs, Codes and Cryptography, vol.44, issue.1-3, pp.225-235, 2008. ,
DOI : 10.1007/s10623-007-9124-z
Fast Software Encryption, 17th International Workshop, Lecture Notes in Computer Science, vol.6147, 2010. ,
Double-Error-Correcting Cyclic Codes and Absolutely Irreducible Polynomials over GF(2), Journal of Algebra, vol.178, issue.2, pp.665-676, 1995. ,
DOI : 10.1006/jabr.1995.1372
Hyperplane sections of fermat varieties in P 3 in char. 2 and some applications to cyclic codes, Cohen et al. [75], pp.180-194 ,
DOI : 10.1007/3-540-56686-4_43
Advances in Cryptology -EUROCRYPT, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings, volume 5479 de Lecture Notes in Computer Science, 2009. ,
Fast Software Encryption -18th International Workshop, Lecture Notes in Computer Science, vol.6733, 2011. ,
Selected Areas in Cryptography, 16th Annual International Workshop, Lecture Notes in Computer Science, vol.5867, 2009. ,
Impossible Differential Cryptanalysis of Reduced-Round LBlock, Askoxylakis et al. [8], pp.179-188 ,
DOI : 10.1007/978-3-642-30955-7_16
The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes, Information and Control, vol.18, issue.4, pp.369-394, 1971. ,
DOI : 10.1016/S0019-9958(71)90473-6
On the weight structure of Reed-Muller codes, IEEE Transactions on Information Theory, vol.16, issue.6, pp.752-759, 1970. ,
DOI : 10.1109/TIT.1970.1054545
Impossible differential cryptanalysis using matrix method, Discrete Mathematics, vol.310, issue.5, pp.988-1002, 2010. ,
DOI : 10.1016/j.disc.2009.10.019
Changhoon Lee et Sangjin Lee : Impossible Differential Cryptanalysis for Block Cipher Structures, Johansson et Maitra [114], pp.82-96 ,
Advances in Cryptology -ASIA- CRYPT '96, International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings, volume 1163 de Lecture Notes in Computer Science, 1996. ,
Truncated and higher order differentials, Preneel [176], pp.196-211 ,
DOI : 10.1007/3-540-60590-8_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4730
DEAL ? A 128-bit cipher, 1998. ,
Robshaw : The Block Cipher Companion. Information Security and Cryptography, 2011. ,
Crooked maps in F 2 n . Finite Fields and Their Applications, pp.713-726, 2007. ,
The only crooked power functions are x 2 k +2 l, Eur. J. Comb, vol.28, issue.4, pp.1345-1350, 2007. ,
Constructing permutations of finite fields via linear translators, J. Comb. Theory, Ser. A, vol.118, issue.3, pp.1052-1061, 2011. ,
Some Theorems on Planar Mappings, pp.117-122 ,
On inverses of APN exponents, ISIT [2], pp.1207-1211 ,
On Inversion in Z 2 n ?1 . Finite Fields and Their Applications, pp.234-254, 2014. ,
Higher Order Derivatives and Differential Cryptanalysis, Symposium on Communication, Coding and Cryptography honor of James L. Massey on the occasion of his 60'th birthday, 1994. ,
DOI : 10.1007/978-1-4615-2694-0_23
Markov Ciphers and Differential Cryptanalysis, Davies [81], pp.17-38 ,
DOI : 10.1007/3-540-46416-6_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.2323
A Note on a Class of Quadratic Permutations over ${\mathbb F}_{{2^n}}$, Boztas et Lu [37], pp.130-137 ,
DOI : 10.1007/978-3-540-77224-8_17
Permutation polynomials and applications to coding theory. Finite Fields and Their Applications, pp.58-70, 2007. ,
Polynômes de Permutation et Application en cryptographie, Cryptanalyse de Registres Combinés, Thèse de doctorat, 2009. ,
On the Classification of 4 Bit S-Boxes, Carlet et Sunar [61], pp.159-176 ,
DOI : 10.1007/978-3-540-73074-3_13
Tor Helleseth et Cunsheng Ding : On the weight distributions of several classes of cyclic codes from APN monomials, 1308. ,
On EA-equivalence of certain permutations to power mappings, Designs, Codes and Cryptography, vol.154, issue.2, pp.259-269, 2011. ,
DOI : 10.1007/s10623-010-9406-8
Permutation polynomials EA-equivalent to the inverse function over GF (2 n ) Cryptography and Communications, pp.175-186, 2011. ,
Finite Fields, de Encyclopedia of Mathematics and its Applications, 1997. ,
DOI : 10.1017/CBO9780511525926
New Observations on Impossible Differential Cryptanalysis of Reduced-Round Camellia, Canteaut [50], pp.90-109 ,
DOI : 10.1007/978-3-642-34047-5_6
URL : https://hal.archives-ouvertes.fr/hal-00922229
Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1, Malkin [153], pp.370-386 ,
DOI : 10.1007/978-3-540-79263-5_24
The Theory of Error-Correcting Codes, 1977. ,
Impossible Differential Attacks on 13-Round CLEFIA-128, Journal of Computer Science and Technology, vol.4, issue.1, pp.744-750, 2011. ,
DOI : 10.1007/s11390-011-1173-0
New Results on Impossible Differential Cryptanalysis of Reduced???Round Camellia???128, pp.281-294 ,
DOI : 10.1007/978-3-642-05445-7_18
Topics in Cryptology -CT-RSA The Cryptographers' Track at the RSA Conference, Proceedings, volume 4964 de Lecture Notes in Computer Science, 2008. ,
Zieve : Permutation binomials over finite fields, Trans. Amer. Math. Soc, 2007. ,
Linear Cryptoanalysis Method for DES Cipher, Helleseth [107], pp.386-397 ,
DOI : 10.1007/3-540-48285-7_33
McEliece : Finite Fields for Computer Scientists and Engineers, 1987. ,
A related key impossible differential attack against 22 rounds of the lightweight block cipher LBlock, Information Processing Letters, vol.112, issue.16, pp.624-629, 2012. ,
DOI : 10.1016/j.ipl.2012.04.012
URL : https://hal.archives-ouvertes.fr/hal-00749136
Permutation polynomials over finite fields. Finite Fields, Coding Theory, and Advances in Commu-nication and Computing, Lecture Notes in Pure and Applied Math, vol.141, pp.131-151 ,
Permutation polynomials and nonsingular feedback shift registers over finite fields, IEEE Transactions on Information Theory, vol.35, issue.4, pp.900-902, 1989. ,
Handbook of Finite Fields. Discrete Mathematics and its Applications, 2013. ,
A note on the coefficients of inverse polynomials. Finite Fields and Their Applications, pp.977-980, 2007. ,
Upper Bounds on Algebraic Immunity of Boolean Power Functions, Robshaw [178], pp.375-389 ,
DOI : 10.1007/11799313_24
Algebraic Immunity of S-Boxes Based on Power Mappings: Analysis and Construction, IEEE Transactions on Information Theory, vol.55, issue.9, pp.4263-4273, 2009. ,
DOI : 10.1109/TIT.2009.2025534
On the construction of highly nonlinear permutations, Rueppel [181], pp.92-98 ,
DOI : 10.1007/3-540-47555-9_8
Differentially uniform mappings for cryptography, Helleseth [107], pp.55-64 ,
DOI : 10.1007/3-540-48285-7_6
S-boxes and round functions with controllable linearity and differential uniformity, Preneel [176], pp.111-130 ,
DOI : 10.1007/3-540-60590-8_9
Generalized Feistel networks, Kim et Matsumoto [124], pp.91-104 ,
DOI : 10.1007/BFb0034838
Fast Software Encryption, 15th International Workshop, Lecture Notes in Computer Science, vol.5086, 2008. ,
Provable Security Against Differential Cryptanalysis, Brickell [43], pp.566-574 ,
DOI : 10.1007/3-540-48071-4_41
Cryptography and Coding, 12th IMA International Conference Proceedings, volume 5921 de Lecture Notes in Computer Science, 2009. ,
DOI : 10.1007/978-3-642-10868-6
Some results concerning cryptographically significant mappings over GF(2 n ), Designs, Codes and Cryptography, vol.47, issue.3, pp.257-269, 2010. ,
DOI : 10.1007/s10623-010-9365-0
Almost Perfect Nonlinear Permutations. Semester project, 1997. ,
Fast Software Encryption : Second International Workshop, Proceedings, volume 1008 de Lecture Notes in Computer Science, pp.14-16, 1994. ,
DOI : 10.1007/3-540-60590-8
Advances in Cryptology -EUROCRYPT International Conference on the Theory and Application of Cryptographic Techniques, Proceeding, volume 1807 de Lecture Notes in Computer Science, 2000. ,
Fast Software Encryption, 13th International Workshop, Lecture Notes in Computer Science, vol.4047, 2006. ,
Functions of degree 4e that are not APN infinitely often, Cryptography and Communications, vol.13, issue.4, pp.227-240, 2011. ,
DOI : 10.1007/s12095-011-0050-6
URL : https://hal.archives-ouvertes.fr/hal-01264167
Advances in Cryptology -EUROCRYPT '92, Workshop on the Theory and Application of of Cryptographic Techniques, Proceedings, volume 658 de Lecture Notes in Computer Science, 1992. ,
Advances in Cryptology -EUROCRYPT '94, Workshop on the Theory and Application of Cryptographic Techniques, Proceedings, volume 950 de Lecture Notes in Computer Science, 1994. ,
Communication Theory of Secrecy Systems*, Bell System Technical Journal, vol.28, issue.4, pp.656-715, 1949. ,
DOI : 10.1002/j.1538-7305.1949.tb00928.x
The 128-Bit Blockcipher CLEFIA (Extended Abstract), In Biryukov, pp.181-195 ,
DOI : 10.1007/978-3-540-74619-5_12
A deterministic test for permutation polynomials, Computational Complexity, vol.21, issue.2, pp.129-132, 1992. ,
DOI : 10.1007/BF01202000
Progress in Cryptology - INDOCRYPT, 8th International Conference on Cryptology in India Proceedings, volume 4859 de Lecture Notes in Computer Science, 2007. ,
Advances in Cryptology -EUROCRYPT '99, International Conference on the Theory and Application of Cryptographic Techniques, Proceeding, volume 1592 de Lecture Notes in Computer Science, 1999. ,
Selected Areas in Cryptography , 7th Annual International Workshop, Proceedings, volume 2012 de Lecture Notes in Computer Science, 2000. ,
On Inversion in Z 2 n ?1, The 11th International Conference on Finite Fields and their Applications, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00931646
New Families of Differentially 4-Uniform Permutations over ${\mathbb F}_{2^{2k}}$, Helleseth et Jedwab, pp.25-39 ,
DOI : 10.1007/978-3-642-30615-0_3
Differentially 4-uniform bijections by permuting the inverse function, Designs, Codes and Cryptography, vol.77, issue.1, p.639, 2013. ,
DOI : 10.1007/s10623-014-9992-y
Impossible differential cryptanalysis of 13-round CLEFIA-128, Journal of Systems and Software, vol.84, issue.7, pp.1191-1196, 2011. ,
DOI : 10.1016/j.jss.2011.02.024
A Known Plaintext Attack of FEAL-4 and FEAL-6, Feigenbaum [97], pp.172-181 ,
DOI : 10.1007/3-540-46766-1_12
The Improbable Differential Attack: Cryptanalysis of Reduced Round CLEFIA, Gong et Gupta [105], pp.197-209 ,
DOI : 10.1007/978-3-642-17401-8_15
Impossible Differential Cryptanalysis of CLEFIA, Nyberg [169], pp.398-411 ,
DOI : 10.1007/978-3-540-71039-4_25
Cryptanalysis of CLEFIA using multiple impossible differentials, 2008 International Symposium on Information Theory and Its Applications, pp.1-6, 2008. ,
DOI : 10.1109/ISITA.2008.4895639
On the inverses of some classes of permutations of finite fields. Finite Fields and Their Applications, pp.244-281, 2014. ,
Dam et Dmitry Fon-Der-Flaass : Codes, graphs, and schemes from nonlinear functions, pp.85-98, 2003. ,
On the Lai-Massey Scheme, pp.8-19 ,
DOI : 10.1007/978-3-540-48000-6_2
Critères de Sécurité des Algorithmes de ChiffrementàChiffrementà Clé Secrète, Thèse de doctorat, 2005. ,
Tests for permutation polynomials, SIAM J. Comput, vol.20, issue.3, pp.591-602, 1991. ,
Modern Computer Algebra, 1999. ,
DOI : 10.1017/CBO9781139856065
Arithmetic of Finite Fields, 2nd International Workshop, Proceedings, volume 5130 de Lecture Notes in Computer Science, 2008. ,
Lectures on Finite Fields and Galois Rings, World Scientific, 2003. ,
DOI : 10.1142/5350
On inverse permutation polynomials. Finite Fields and Their Applications, pp.207-213, 2009. ,
DOI : 10.1016/j.ffa.2008.12.003
URL : http://doi.org/10.1016/j.ffa.2008.12.003
On quadratic almost perfect nonlinear functions and their related algebraic object. The International Workshop on Coding and Cryptography, pp.57-68, 2013. ,
The compositional inverse of a class of linearized permutation polynomials over F 2 n , n odd. Finite Fields and Their Applications, pp.34-48, 2014. ,
Tor Helleseth et Yuqing Zhang : More Classes of Complete Permutation Polynomials over F q . CoRR, abs/1312, p.4716, 2013. ,
LBlock: A Lightweight Block Cipher, Lopez et Tsudik [148], pp.327-344 ,
DOI : 10.1007/978-3-642-19574-7_16
Improved Impossible Differential Cryptanalysis of Reduced-Round Camellia, Avanzi et al. [11], pp.442-456 ,
DOI : 10.1007/978-3-540-76788-6_19
Impossible Differential Cryptanalysis of Reduced-Round ARIA and Camellia, Journal of Computer Science and Technology, vol.91, issue.1, pp.449-456, 2007. ,
DOI : 10.1007/s11390-007-9056-0
Equivalences of quadratic APN functions, Journal of Algebraic Combinatorics, vol.56, issue.3, pp.461-475, 2012. ,
DOI : 10.1007/s10801-011-0309-1
A matrix approach for constructing quadratic APN functions. The International Workshop on Coding and Cryptography, pp.47-56, 2013. ,
Permutation polynomials of the form L(x) + S a 2k + S b 2k over F q 3k . Finite Fields and Their Applications, pp.29106-117, 2014. ,
Impossible Differential-Linear Cryptanalysis of Full-Round CLEFIA-128, IACR Cryptology ePrint Archive, p.301, 2013. ,
Information Security and Cryptology, 4th International Conference, 2008. ,
DOI : 10.1007/978-3-642-01440-6
A New Family of Perfect Nonlinear Binomials, IACR Cryptology ePrint Archive, p.196, 2008. ,
Impossible Differential Analysis of Reduced Round CLEFIA, pp.181-191 ,
DOI : 10.1007/978-3-642-01440-6_15
Advances in Cryptology -ASIACRYPT, 8th International Conference on the Theory and Application of Cryptology and Information Security Proceedings, volume 2501 de Lecture Notes in Computer Science, 2002. ,