I. Al-kadi, Origins of cryptology : The arab contributions . Cryptologia, pp.97-126, 1992.

M. Albrecht, Algorithmic Algebraic Techniques and their Application to Block Cipher Cryptanalysis, 2010.

M. Albrecht and C. Cid, Algebraic techniques in differential cryptanalysis Cryptology ePrint Archive, Report, vol.177, 2008.
DOI : 10.1007/978-3-642-03317-9_12

X. Ameil, J. Vasseur, and G. Ruggiu, Histoire de la machine myosotis. Colloques sur l'Histoire de l'Informatique, des Réseaux et des Télécommunications, pp.95-125, 2004.

F. Armknecht, On the existence of low-degree equations for algebraic attacks, ecrypt network of excellence -SASC Workshop Record, 2004.

F. Armknecht and S. Lucks, Linearity of the AES Key Schedule, Proceedings of the 4th International Conference, pp.159-169, 2004.
DOI : 10.1007/11506447_14

E. Artin, Galois Theory -Second Edition, 1964.

E. Artin, Algebraic Numbers and Algebraic Functions, 1967.
DOI : 10.1090/chel/358

E. F. Assmus, On the Reed-Muller codes, Discrete Mathematics, vol.106, issue.107, pp.25-33, 1992.
DOI : 10.1016/0012-365X(92)90526-L

URL : https://doi.org/10.1016/0012-365x(92)90526-l

A. Atanasov, A short primer on cryptography, Columbia Science Review, vol.5, pp.10-13, 2008.

T. Baignères, P. Junod, Y. Lu, J. Monnerat, and S. Vaudenay, A Classical Introduction to Cryptography Applications for Communications Security -Exercise book, 2006.

A. Baker, A concise introduction to the theory of numbers, 1984.
DOI : 10.1017/CBO9781139171601

S. Bakhtiari, Linear Cryptanalysis of DES Cipher, 1994.

M. Bardet, J. Faugère, and B. Salvy, Complexity of gröbner basis computation for semi-regular overdetermined sequences over f2 with solutions in f2, 2003.

E. Barkan and E. Biham, The Book of Rijndaels. Cryptology ePrint Archive, Report, vol.158158, 2002.

E. Barkan and E. Biham, In how many ways can you write rijndael ? Advances in Cryptology -ASIACRYPT, pp.160-175, 2002.
DOI : 10.1007/3-540-36178-2_10

URL : https://link.springer.com/content/pdf/10.1007%2F3-540-36178-2_10.pdf

S. Bhupendra, A. Lexy, and S. Burman, On algebraic relations of serpent s-boxes. Cryptology ePrint Archive, Report, vol.038, 2009.

E. Biham and A. Shamir, Differential cryptanalysis of DES-like cryptosystems, 2005.
DOI : 10.1007/3-540-38424-3_1

URL : http://www.crypto.nkfu.edu.tw/CRYPTO/biham.pdf

A. Biryukov, O. Dunkelman, N. Keller, D. Khovratovich, and A. Shamir, Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds, Cryptology ePrint Archive Report, vol.374374, 2009.
DOI : 10.1007/978-3-642-13190-5_15

URL : https://link.springer.com/content/pdf/10.1007%2F978-3-642-13190-5_15.pdf

R. Blahut, Algebraic Codes for Data Transmission, 2003.
DOI : 10.1017/CBO9780511800467

R. Blahut, Algebraic Codes on Lines, Planes and Curves, 2008.
DOI : 10.1017/CBO9780511543401

L. Blum, M. Blum, and M. Shub, Comparison of two pseudo-random number generators Advances in Cryptology, pp.61-78, 1983.
DOI : 10.1007/978-1-4757-0602-4_6

L. Blum, M. Blum, and M. Shub, A Simple Unpredictable Pseudo-Random Number Generator, SIAM Journal on Computing, vol.15, issue.2, pp.364-383, 1986.
DOI : 10.1137/0215025

A. Bogdanov, D. Khovratovich, and C. Rechberger, Biclique cryptanalysis of the full AES. Cryptology ePrint Archive, Report, vol.449, 2011.
DOI : 10.1007/978-3-642-25385-0_19

URL : https://link.springer.com/content/pdf/10.1007%2F978-3-642-25385-0_19.pdf

A. Bogdanov and A. Pyshkin, Algebraic side-channel collision attacks on AES. Cryptology ePrint Archive, Report, vol.477, 2007.
DOI : 10.1007/978-3-540-77360-3_6

URL : http://www.crypto.ruhr-uni-bochum.de/imperia/md/content/texte/publications/conferences/aes_collisions_sac.pdf

G. Boole, The Mathematical Analysis of Logic, 1847.
DOI : 10.1017/cbo9780511701337

G. Boole, An Investigation of the Laws of Thought, Courier Dover Publications, 1853.
DOI : 10.1017/CBO9780511693090

W. Bosma, The Magma Computational Algebra System (Version 2.22-6), 2016

R. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, vol.35, issue.8, pp.677-691, 1986.
DOI : 10.1109/TC.1986.1676819

URL : http://www.paradise.caltech.edu/cns188/Handouts/Bryant86.pdf

B. Buchberger, Gröbner bases : A short introduction for systems theorists Computer Aided Systems Theory ? EUROCAST, pp.1-19, 2001.

B. Buchberger and F. Winkler, Gröbner Bases and Applications, 1998.

S. Bulygin and M. Brickenstein, Obtaining and solving systems of equations in key variables only for the small variants of AES. Cryptology ePrint Archive, Report, vol.435, 2008.

A. Canteaut, Cryptographic Functions and Design Criteria for Block Ciphers, pp.1-16, 2001.
DOI : 10.1007/3-540-45311-3_1

URL : http://www-rocq.inria.fr/codes/Anne.Canteaut/Publications/Canteaut01c.pdf

A. Canteaut, Cryptanalyse des chiffrements à clef secrète par blocs, 2002.

A. Canteaut, Open Problems Related to Algebraic Attacks on Stream Ciphers, WCC 2005, pp.120-134, 2005.
DOI : 10.1007/3-540-44598-6_31

URL : http://www-rocq.inria.fr/codes/Anne.Canteaut/Publications/wcc05-proceedings.pdf

C. Carlet, Boolean Functions for Cryptography and Error-Correcting Codes, 2010.
DOI : 10.1017/CBO9780511780448.011

URL : http://www-rocq.inria.fr/codes/Claude.Carlet/chap-fcts-Bool.pdf

C. Carlet, Vectorial Boolean Functions for Cryptography, 2010.
DOI : 10.1017/CBO9780511780448.012

A. Casamayou, Calcul mathématique avec SAGE. CreateSpace Independent Publishing Platform, 2013.

P. Cayrel, Construction et optimisation de cryptosystèmes basés sur les codes correcteurs d'erreurs, 2008.

F. Chabaud and S. Vaudenay, Links between differential and linear cryptanalysis, Advances in Cryptology -EUROCRYPT'94, pp.356-365, 1995.
DOI : 10.1007/BFb0053450

URL : http://umjy.chonnam.ac.kr/~journey/cs/crypto/papers/liens-94-3_a4.ps

J. Chen, N. Courtois, and B. Yang, On asymptotic security estimates in XL and gröbner bases-related algebraic cryptanalysis. Information Security and Cryptology ? ICISC, pp.401-413, 2004.

J. Chen and B. Yang, All in the XL family : Theory and practice. Information Security and Cryptology ? ICISC, pp.67-86, 2004.

L. Chu-wee and K. Khoongming, An analysis of XSL applied to BES, Lecture Notes in Computer Science, vol.4593, pp.242-253, 2007.

C. Cid, Some algebraic aspects of the AES, Proceedings of the 4th International Conference, pp.58-66, 2004.

C. Cid, G. Cid, S. Murphy, and M. Robshaw, An Analysis of the XSL Algorithm, Seventh International Workshop on Computer Algebra in Scientific Computing, pp.333-33593, 2004.
DOI : 10.1007/11593447_18

URL : https://link.springer.com/content/pdf/10.1007%2F11593447_18.pdf

C. Cid, S. Murphy, and M. Robshaw, An Algebraic Framework for Cipher Embeddings, 10th IMA International Conference, pp.278-289, 2005.
DOI : 10.1007/11586821_19

URL : http://www.isg.rhul.ac.uk/~sean/alg_emb_IMA.pdf

C. Cid, S. Murphy, and M. Robshaw, Small scale variants of the advanced encryption standard. Fast Software Encryption, pp.145-162, 2005.

C. Cid, S. Murphy, and M. Robshaw, Some Algebraic Aspects of the Advanced Encryption Standard, 2006.
DOI : 10.1007/11506447_6

URL : http://www.isg.rhul.ac.uk/~ccid/publications/aes4_ccid.pdf

C. Cid and M. Robshaw, Comments on the security of the AES and the XSL technique, Electronic Letters, vol.39, pp.26-38, 2003.

G. Conti and S. Bratus, Voyage of the reverser : A visual study of binary species, 2010.

G. Conti, E. Dean, M. Sinda, and B. Sangster, Visual Reverse Engineering of Binary and Data Files, 2008.
DOI : 10.1007/978-3-540-85933-8_1

URL : http://www.rumint.org/gregconti/publications/2008_VizSEC_FileVisualization_v53_final.pdf

J. Cooley and J. Tukey, An algorithm for the machine calculation of complex Fourier series, Mathematics of Computation, vol.19, issue.90, 1965.
DOI : 10.1090/S0025-5718-1965-0178586-1

N. Courtois, Algebraic attacks over GF (2 k ). 7th International Workshop on Theory and Practice in Public Key Cryptography, pp.201-217, 2004.

N. Courtois, General Principles of Algebraic Attacks and New Design Criteria for Cipher Components, Proceedings of the 4th International Conference, pp.67-83, 2004.
DOI : 10.1007/11506447_7

N. Courtois, How fast can be algebraic attacks on block ciphers ? Cryptology ePrint Archive, Report, vol.168, 2006.
DOI : 10.1007/978-3-540-45146-4_11

URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-45146-4_11.pdf

N. Courtois and G. Bard, Algebraic cryptanalysis of the DES. Cryptology ePrint Archive, Report, vol.402, 2006.

N. Courtois and W. Meier, Algebraic attacks on stream ciphers with linear feedback, Advances in Cryptology ? EUROCRYPT 2003, pp.345-359, 2003.
DOI : 10.1007/3-540-39200-9_21

URL : https://link.springer.com/content/pdf/10.1007%2F3-540-39200-9_21.pdf

N. Courtois and J. Pieprzyk, Cryptanalysis of Block Ciphers with Overdefined Systems of Equations, Cryptology ePrint Archive, 2002.
DOI : 10.1007/3-540-36178-2_17

N. Courtois and J. Pieprzyk, Cryptanalysis of block ciphers with overdefined systems of equations Advances in Cryptology -ASIACRYPT, pp.267-287, 2002.

D. Cox and J. Little, and Donald 0'Shea. Ideals, Varieties, and Algorithms . Undergraduate Texts in Mathematics, 2000.

Y. Crama and P. Hammer, Boolean functions -Theory, Algorithms, and Applications, 2011.

D. Crnkovié and V. Tonchev, Information Security, Coding Theory and Related Combinatorics, 2010.

J. Daemen, L. Knudsen, and V. Rijmen, The block cipher square. Fast Software Encryption, pp.149-165, 1997.
DOI : 10.1007/bfb0052343

URL : https://link.springer.com/content/pdf/10.1007%2FBFb0052343.pdf

J. Daemen and V. Rijmen, AES proposal : Rijndael, 1999.
DOI : 10.1007/0-387-23483-7_358

J. Daernen and V. Rijmen, The design of Rijndael : AES -the Advanced Encryption Standard, 2002.

C. De, C. , and A. Biryukov, Block ciphers and systems of quadratic equations. Fast Software Encryption, pp.274-289, 2003.

C. De-cannière, A. Biryukov, and B. Preneel, An introduction to Block Cipher Cryptanalysis, Proceedings of the IEEE, pp.346-356, 2006.
DOI : 10.1109/JPROC.2005.862300

K. De, L. , and J. Bergstra, The History of Information Security : A Comprehensive Handbook, 2007.

F. Didier, Codes de Reed-Muller et cryptanalyse du registre filtré, 2007.

C. Diem, The XL-Algorithm and a Conjecture from Commutative Algebra, Proceedings of Asiacrypt 2004, pp.323-337, 2004.
DOI : 10.1007/978-3-540-30539-2_23

URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-30539-2_23.pdf

W. Diffie and M. Hellman, Cryptography and computer privacy, Scientific American, vol.228, pp.55-78, 1973.

W. Diffie and M. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-654, 1976.
DOI : 10.1109/TIT.1976.1055638

URL : http://www.cs.rutgers.edu/~tdnguyen/classes/cs671/presentations/Arvind-NEWDIRS.pdf

H. Dobbertin, L. Knudsen, and M. Robshaw, The Cryptanalysis of the AES ??? A Brief Survey, Proceedings of the 4th International Conference, pp.1-10, 2004.
DOI : 10.1007/11506447_1

C. Domas, The future of re : Dynamic binary visualization Reverse engineering conference (REcon), 2013.

M. Dubois, Description algébrique de l'advanced encryption standard, MISC, vol.55, pp.72-82, 2011.

M. Dubois, Github repositories, 2017.

M. Dubois and É. Filiol, Proposal for a new equation system modelling of block ciphers, Proceedings of the 2nd IMA Conference on Mathematics in Defence, 2011.

M. Dubois and É. Filiol, Proposal for a new equation system modelling of block ciphers and application to AES 128, Proceedings of the 11th European Conference on Information Warfare and Security, pp.303-312, 2012.

M. Dubois and É. Filiol, Proposal for a new equation system modelling of block ciphers and application to AES 128 -long version, Number Theory and its Applications, pp.11-40, 2012.

M. Dubois and É. Filiol, 3d visualization applied to prbgs and cryptography, Proceedings of the 11th International Conference on Cyber Warfare and Security, pp.371-381, 2016.
DOI : 10.13189/csit.2016.040502

M. Dubois and É. Filiol, 3D Visualization Applied to PRBGs and Cryptography- Long Version, Computer Science and Information Technology, vol.4, issue.5, pp.171-180, 2016.
DOI : 10.13189/csit.2016.040502

M. Dubois and É. Filiol, Hacking of the AES with boolean functions. 1st International Workshop on FORmal methods for Security Engineering -ForSE 2017, pp.599-609, 2016.
DOI : 10.5220/0006091305990609

URL : http://arxiv.org/pdf/1609.03734

M. Dubois and É. Filiol, Hacking of the AES with boolean functions long version
DOI : 10.5220/0006091305990609

URL : http://arxiv.org/pdf/1609.03734

M. Dubois and É. Filiol, Visualisation 3d appliquée aux prbg et à la cryptographie, MISC, vol.83, pp.74-82, 2016.

J. Eaton, D. Bateman, S. Hauberg, and R. Wehbring, GNU Octave version 4.2.0 manual : a high-level interactive language for numerical computations. Free Software Foundation, 2016.

J. Faugère, A new efficient algorithm for computing gröbner bases (F4) Journal of Pure and Applied Algebra, pp.61-88, 1999.

J. Faugère, A new efficient algorithm for computing gröbner bases without reduction to zero (F5) Proceedings of the, international symposium on Symbolic and algebraic computation, pp.75-83, 2002.

J. Faugère and A. Joux, Algebraic cryptanalysis of hidden field equation (hfe) cryptosystems using gröbner bases, Advances in Cryptology ? CRYPTO 2003, pp.44-60, 2003.

N. Ferguson, J. Kelsey, S. Lucks, B. Schneier, M. Stay et al., Improved Cryptanalysis of Rijndael, Fast Software Encryption, pp.213-230, 1978.
DOI : 10.1007/3-540-44706-7_15

URL : https://link.springer.com/content/pdf/10.1007%2F3-540-44706-7_15.pdf

N. Ferguson, R. Schroeppel, and D. Whiting, A simple algebraic representation of rijndael. Selected Areas in Cryptography, pp.103-111, 2001.
DOI : 10.1007/3-540-45537-x_8

URL : http://www.macfergus.com/niels/pubs/rdalgeq-draft.pdf

É. Filiol, A New Statistical Testing for Symmetric Ciphers and Hash Functions, Proceedings of Information and Communications Security, pp.342-353, 2002.
DOI : 10.1007/3-540-36159-6_29

URL : http://eprint.iacr.org/2002/099.ps

É. Filiol, Reconstruction Techniques in Cryptology and in Coding Theory, 2005.

É. Filiol, Dynamic cryptographic trapdoors. CanSecWest, 2011.

É. Filiol and C. Fontaine, Highly nonlinear balanced Boolean functions with a good correlation-immunity, Advances in Cryptology ? EUROCRYPT'98, pp.475-488, 1998.
DOI : 10.1007/BFb0054147

C. Fontaine, Contribution à la recherche de fonctions booléennes hautement non linéaires, et au marquage d'images en vue de la protection des droits d'auteur, 1998.

J. Fuller and W. Millan, On linear redundancy in the AES s-box. Fast Software Encryption, pp.74-86, 2003.
DOI : 10.1007/978-3-540-39887-5_7

URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-39887-5_7.pdf

B. Gellman and A. Soltani, Nsa infiltrates links to yahoo, google data centers worldwide, snowden documents say. The Washington Post, 2013. https

S. Goldwasser and M. Bellare, Lecture notes on cryptography, 2008.

. Secrétaire-général-de-la-défense-et-de-la-sécurité-nationale, Instruction générale interministérielle 1300 sur la protection du secret de la défense nationale, 2011.

M. Haahr and . Random, org : True random number service, 2016.

C. Hamilton, Compact hilbert indices, 2006.
DOI : 10.1109/cisis.2007.16

URL : http://web.cs.dal.ca/~arc/publications/2-43/paper.pdf

P. Higgins, Number story : from counting to cryptography. Copernicus book -Springler, 2008.

D. Hilbert, Ueber die stetige Abbildung einer Line auf ein Fl???chenst???ck, Mathematische Annalen, vol.38, issue.3, pp.459-460, 1891.
DOI : 10.1007/BF01199431

T. Jakobsen and L. Knudsen, Attacks on Block Ciphers of Low Algebraic Degree, Journal of Cryptology, vol.14, issue.3, pp.197-210, 2001.
DOI : 10.1007/s00145-001-0003-x

URL : http://ns.ioi.dk/Homepages/tj/publications/abclad.ps

P. Junod, Cryptographic secure pseudo-random bits generation : The blum-blum-shub generator The Codebreakers, 1996.

M. Kalkbrener, Solving systems of algebraic equations by using gröbner bases, Proceedings of European Conference on Computer Algebra, pp.282-292, 1987.
DOI : 10.1007/3-540-51517-8_127

M. Kennel, R. Brown, and H. Abarbanel, Determining embedding dimension for phase-space reconstruction using a geometrical construction, Physical Review A, vol.45, issue.6, pp.3403-3411, 1992.
DOI : 10.1103/PhysRevLett.45.712

E. Kleiman, The XL and XSL attacks on Baby Rijndael, 2005.

L. Knudsen, Contemporary block ciphers. Lectures on Data Security, pp.105-126, 1999.
DOI : 10.1007/3-540-48969-x_5

L. Knudsen and M. Robshaw, The Block Cipher Companion, 2011.
DOI : 10.1007/978-3-642-17342-4

URL : https://link.springer.com/content/pdf/bfm%3A978-3-642-17342-4%2F1.pdf

D. Ervin and K. , The Art of Computer Programming, volume Volume 2 -Seminumerical Algorithms, 1981.

N. Koblitz, A Course in Number Theory and Cryptography, 1994.
DOI : 10.1007/978-1-4419-8592-7

S. Landau, Communications security for the twenty-first century : The advanced encryption standard. Notices of the, pp.450-459, 2000.

S. Landau, Standing the test of time : The data encryption standard. Notices of the, pp.341-349, 2000.

S. Landau, Polynomials in the Nation's Service: Using Algebra to Design the Advanced Encryption Standard, The American Mathematical Monthly, vol.34, issue.2, pp.89-117, 2004.
DOI : 10.1109/18.6037

T. Van and L. , Novel cyclic and algebraic properties of AES. Cryptology ePrint Archive, Report, vol.108, 2003.

R. Lidl and H. Niederreiter, Introduction to finite fields and their applications, 1986.
DOI : 10.1017/CBO9781139172769

R. Lidl and H. Niederreiter, Finite Fields -Encyclopedia of Mathematics and its Applications, 1997.

R. Lidl and H. Niederreiter, Introduction to finite fields and their applications, 2000.
DOI : 10.1017/CBO9781139172769

F. Massey, The Kolmogorov-Smirnov Test for Goodness of Fit, Journal of the American Statistical Association, vol.4, issue.253, pp.68-78, 1951.
DOI : 10.1214/aoms/1177732209

J. Massey, Some applications of coding theory in cryptography. Codes and Ciphers : Cryptography and Coding IV, pp.33-47, 1995.
DOI : 10.1002/ett.4460050405

URL : http://www.isi.ee.ethz.ch/publications/isipap/mass-inspec-1994-2.pdf

J. Massey, Applied digital information theory, 2001.

M. Matsui, Linear cryptanalysis method for DES cipher Advances in Cryptology -EUROCRYPT 1993, pp.386-397, 1993.

U. Maurer, A universal statistical test for random bit generators, Journal of cryptology, vol.5, pp.89-105, 1992.
DOI : 10.1007/bf00193563

R. May, Simple mathematical models with very complicated dynamics, Nature, vol.29, issue.5560, pp.459-467, 1976.
DOI : 10.2307/3863

P. Mccarty, Introduction to Arithmetical Functions, 1986.
DOI : 10.1007/978-1-4613-8620-9

A. Menezes, P. Oorschot, and S. Vanstone, Handbook of applied cryptography, 1997.
DOI : 10.1201/9781439821916

J. Milne, Algebraic number theory

J. Milne, Class field theory

J. Milne, Fields and galois theory

J. Monnerat and S. Vaudenay, On Some Weak Extensions of AES and BES, 6th International Conference -Information and Communications Security, pp.414-426, 2004.
DOI : 10.1007/978-3-540-30191-2_32

URL : http://www.monnerat.info/publications/bigbes.pdf

S. Murphy and M. Robshaw, Essential algebraic structure within the AES Advances in Cryptology -CRYPTO, pp.1-16, 2002.
DOI : 10.1007/3-540-45708-9_1

URL : http://www.iacr.org/archive/crypto2002/24420001/24420001.pdf

M. Musa, E. Schaefer, and S. Wedig, A simplified AES algorithm and its linear and differential cryptanalyses. Cryptologia, pp.148-177, 2003.
DOI : 10.1080/0161-110391891838

K. Nance, S. Tricaud, and P. Saadé, Visualizing network activity using parallel coordinates, 44th Hawaii International Conference on System Sciences, 2011.

J. Neil, Computability and Complexity, 1997.

H. Nover, Algebraic cryptanalysis of AES an overview, 2004.

O. Ryan, Analysis of Boolean Functions, 2014.

D. Olejar and M. Stanek, On cryptographic properties of random boolean functions, Electronic Journal of Universal Computer Science, vol.4, pp.705-717, 1998.

N. Packard, J. Crutchfield, D. Farmer, and R. Shaw, Geometry from a Time Series, Physical Review Letters, vol.77, issue.9, pp.712-716, 1980.
DOI : 10.1016/0375-9601(80)90519-8

G. Peano, Sur une courbe, qui remplit toute une aire plane, Mathematische Annalen, vol.36, issue.1, pp.157-160, 1890.
DOI : 10.1007/BF01199438

D. Perrin, Cours d'algèbre. Éditions ellipses, 1996.

DOI : 10.1080/0161-110291890948

V. Platonov and A. Rapinchuk, Algebraic groups and number theory, Russian Mathematical Surveys, vol.47, issue.2, 1991.
DOI : 10.1070/RM1992v047n02ABEH000879

B. Preneel, R. Govaerts, and J. Vandewalle, Cryptographic properties of quadratic boolean functions, 1st International Conference on Finite Fields and Applications, 1991.

B. Preneel, W. Van-leekwijck, L. Van-linden, R. Govaerts, and J. Vandewalle, Propagation characteristics of boolean functions Advances in Cryptology -EUROCRYPT, pp.161-173, 1990.

I. Reed, A class of multiple-error-correcting codes and the decoding scheme. Information Theory, IRE Professional Group on, vol.4, pp.31-49, 1954.

M. Renauld and F. Standaert, Algebraic side-channel attacks. Cryptology ePrint Archive, Report, vol.279, 2009.
DOI : 10.1007/978-3-642-16342-5_29

URL : http://eprint.iacr.org/2009/279.pdf

V. Rijmen, Cryptanalysis and Design of Iterated Block Ciphers, 1997.

J. Vincent-rijmen, B. Daemen, A. Preneel, and . Bosselaers, The cipher shark, 1996.

A. Rimoldi, M. Sala, and E. Bertolazzi, Do AES encryptions act randomly ? CoRR, abs/1011, 2010.

A. Rimoldi, M. Sala, and I. Toli, A possible intrinsic weakness of AES and other cryptosystems. CoRR, abs/1006, 2010.

K. Rosen, Discrete Mathematics and its Applications -Seventh Edition, 2012.

A. Rukhin, A statistical test suite for random and pseudorandom number generators for cryptographic applications. National Institute of Standards and Technology, 2010.
DOI : 10.6028/nist.sp.800-22

URL : http://csrc.ncsl.nist.gov/publications/nistpubs/800-22-rev1/SP800-22rev1.pdf

B. Sakkour, Étude et amélioration du décodage des codes de Reed- Muller d'ordre deux, 2007.

P. Sarkar and S. Maitra, Construction of Nonlinear Boolean Functions with Important Cryptographic Properties, Advances in Cryptology -EUROCRYPT, pp.485-506, 2000.
DOI : 10.1007/3-540-45539-6_35

URL : http://www.iacr.org/archive/eurocrypt2000/1807/18070491-new.pdf

P. Sarkar and S. Maitra, New directions in design of resilient boolean functions, p.9, 2000.

N. Sarkozy, D. Perben, R. Donnedieu-de-vabres, B. Girardin, and P. Devedjian, pour la confiance dans l'économie numérique, Journal officiel de la République française, 2004.

B. Schneier, Cryptographie appliquée : algorithmes, protocoles et codes source en C. Éditions Vuibert, 2002.

E. Schröder, J. Lüroth, and K. E. Müller, Vorlesungen über die Algebra der Logik, p.1895

J. Seberry and B. Song, Further observations on the structure of the AES algorithm, Fast Software Encryption, vol.2887, pp.223-233, 2003.

A. Shamir, J. Patarin, N. Courtois, and A. Klimov, Efficient algorithms for solving overdefined systems of multivariate polynomial equations Advances in Cryptology ? EUROCRYPT, pp.392-407, 2000.

S. Singh, Histoire des codes secrets. Éditions Jean-Claude Lattès, 1999.

S. Tricaud and P. Saadé, Applied parallel coordinates for logs and network traffic attack analysis, Journal in Computer Virology, vol.7, issue.2, pp.1-29, 2010.
DOI : 10.1002/j.1538-7305.1950.tb00463.x

T. Van-lee, R. Sparr, R. Wernsdorf, and Y. Desmedt, Complementation-Like and Cyclic Properties of AES Round Functions, Proceedings of the 4th International Conference, pp.128-141, 2004.
DOI : 10.1007/11506447_11

. Henk-van-tilborg, Fundamentals of Cryptology, 2000.

. Henk-van-tilborg, Coding theory : a first course, 2013.

S. Vaudenay, A Classical Introduction to Cryptography Applications for Communications Security, 2006.

V. Velichkov, V. Rijmen, and B. Preneel, Algebraic cryptanalysis of a small-scale version of stream cipher Lex, IET Information Security, vol.4, issue.2, pp.49-61, 2010.
DOI : 10.1049/iet-ifs.2009.0118

V. Vitse, Attaques algébriques du problème du logarithme discret sur courbes elliptiques, 2011.

. John-von-neumann, Various techniques used in connection with random digits, Monte Carlo Method, vol.12, pp.36-38, 1951.

D. Wagner, The boomerang attack. Fast Software Encryption, pp.156-170, 1999.
DOI : 10.1007/3-540-48519-8_12

F. Webster and S. Tavares, On the design of s-boxes Advances in Cryptology -CRYPTO 85 Proceedings, pp.523-534, 1986.

R. Weinmann, Evaluating Algebraic Attacks on the AES, 2003.

E. Weisstein, Closed-form solution, 2016.

E. Weisstein, Logistic map, 2016.

E. Weisstein, Pi digits, 2016.

Y. Ying, The use of the big encryption system (BES) for the cryptanalysis of the advanced encryption system (AES), 2003.

A. Youssef and S. Tavares, On some algebraic structure in the AES round function. IACR Cryptology ePrint Archive, 2002.
DOI : 10.1016/j.dam.2005.02.001

URL : https://doi.org/10.1016/j.dam.2005.02.001

A. Youssef and S. Tavares, Affine equivalence in the AES round function, Discrete Applied Mathematics, vol.148, issue.2, pp.161-170, 2005.
DOI : 10.1016/j.dam.2005.02.001

URL : https://doi.org/10.1016/j.dam.2005.02.001

M. Zalewski, Strange attractors and tcp/ip sequence number analysis . lcamtuf.coredump.cx, 2001.

M. Zalewski, Strange attractors and tcp/ip sequence number analysis -one year later. lcamtuf.coredump.cx, 2002.

N. Zensho, Logic functions over galois field GF(4) Bulletin of the Faculty of Engineering, pp.47-59, 1985.