Feistel Schemes and Bi-linear Cryptanalysis (Extended Abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3152, Issue , 2004, Pages 23-40

  Courtois, Nicolas T ^a  

^a GEMPLUS   (France)

Author keywords

Block ciphers; Correlation attacks on block ciphers; DES; Feistel schemes; Generalised linear cryptanalysis; I o sums; Inverse based s box; Linear cryptanalysis; Multivariate quadratic equations; S box design

Indexed keywords

LYAPUNOV METHODS; SECURITY OF DATA;

BLOCK CIPHERS; DES; FEISTEL SCHEME; INVERSE-BASED S-BOX; LINEAR CRYPTANALYSIS; MULTIVARIATE QUADRATIC EQUATIONS; S-BOX DESIGN;

CRYPTOGRAPHY;

EID: 26444532237     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28628-8_2     Document Type: Article

References (30)

1. Eli Biham: On Matsui's Linear Cryptanalysis, Eurocrypt'94, LNCS 950, Springer-Verlag pp. 341-355, 1994.
2. Eli Biham and Adi Shamir, Differentia] Cryptanalysis ofDES-like Cryptosystems. Journal of Cryptology, vol. 4, pp. 3-72, IACR, 1991.
3. Anne Canteaut, Marion Videau: Degree of composition of highly nonlinear functions and applications to higher order differential Cryptanalysis, Eurocrypt 2002, LNCS 2332, Springer, 2002.
4. Anne Tardy-Corfdir, Henri Gilbert: A Known Plaintext Attack of FEAL-4 and FEAL-6, Crypto'91, LNCS 576, Springer, pp. 172-181, 1992.
5. Nicolas Courtois, Guilhem Castagnos and Louis Goubin: What do DES S-boxes Say to Each Other ? Available on eprint.iacr.org/2003/184/.
6. D.W. Davies, Some Regular Properties of the Data Encryption Standard, Crypto'82, pp. 89-96, Plenum Press, New-York, 1982.
7. D. Davies and S. Murphy, Pairs and Triplets of DES S-Boxes, Journal of Cryptology, vol. 8, Nb. 1, pp. 1-25, 1995.
8. Data Encryption Standard (DES), Federal Information Processing Standards Publication (FIPS PUB) 46-3, National Bureau of Standards, Gaithersburg, MD (1999). http://csrc.nist.gov/publications/fips/fips46-3/fips46-3.pdf
9. C. Harpes, G. Kramer, and J. Massey: A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-up Lemma, Eurocrypt'95, LNCS 921, Springer, pp. 24-38. http://www.isi.ee.ethz.ch/ harpes/GLClong.ps
10. Carlo Harpes: Cryptanalysis of iterated block ciphers, PhD thesis, No 11625, Swiss Federal Int. of Tech., ETH Series in Information Processing, Ed. J. L. Massey, Hartung-Gorre Verlag Konstanz, 1996, ISBN 3-89649-079-6, ISSN 0942-3044.
11. Carlo Harpes: Partitioning Cryptanalysis, Post-Diploma Thesis, Signal and Information Processing Lab., Swiss Federal Institute of Technology, Zurich, March 1995. http://www.isi.ee.ethz.ch/~harpes/pc.ps
12. Thomas Jakobsen, Carlo Harpes: Non-Uniformity Measures for Generalized Linear Cryptanalysis and Partitioning Cryptanalysis, Pragocrypt'96, 1996.
13. Thomas Jakobsen: Correlation Attacks on Block Ciphers, Master's Thesis, Dept. of Mathematics, Technical University of Denmark, January 1996.
14. Thomas Jakobsen: Higher-Order Cryptanalysis of Block Ciphers. Ph.D. thesis, Dept. of Math., Technical University of Denmark, 1999.
15. Thomas Jakobsen: Cryptanalysis of Block Ciphers with Probabilistic Non-Linear Relations of Low Degree, Crypto 98, LNCS 1462, Springer, pp. 212-222, 1998.
16. Pascal Junod: On the complexity of Matsui's attack, Selected Areas in Cryptography (SAC'01), Toronto, Canada, LNCS 2259, pp. 199-211, Springer, 2001.
17. Burton S. Kaliski Jr, and M.J.B. Robshaw. Linear Cryptanalysis Using Multiple Approximations, Crypto'94, LNCS, Springer, pp. 26-39, 1994.
18. Toshinobu Kaneko and Takeshi Shimoyama: Quadratic Relation of S-box and Its Application to the Linear Attack of Full Round DES, In Crypto 98, LNCS 1462, p. 200-211, SPringer, 1998.
19. Kwangjo Kim. Sangjin Lee, Sangjoon Park, Daiki Lee: Securing DES S-boxes against Three Robust Cryptanalysis, SAC'95, pp.145-157, 1995.
20. Lars R. Knudsen, Matthew J. B. Robshaw: Non-Linear Characteristics in Linear Cryptoanalysis. Eurocrypt'96, LNCS 1070, Springer, pp. 224-236, 1996.
21. Lars R. Knudsen, John Erik Mathiassen: A Chosen-Plaintext Linear Attack on DES. FSE'2000, LNCS 1978, Springer, pp. 262-272, 2001.
22. Matthew Kwan: The Design of the ICE Encryption Algorithm, FSE'97, 4th International Workshop, Haifa, Israel, Springer, LNCS 1267, pp. 69-82, 1997. Available from http://www.darkside.com.au/ice/ice.ps.gz.
23. Susan K. Langford, Martin E. Hellman: Differential-linear Cryptanalysis, Crypto 94, LNCS 839, pp. 17-25, Springer, 1994.
24. Michael Luby, Charles W. Rackoff, How to construct pseudorandom permutations from pseudorandom functions, SIAM Journal on Computing, vol. 17, n. 2, pp. 373-386, April 1988.
25. M. Matsui: Linear Cryptanalysis Method for DES Cipher, Eurocrypt'93, LNCS 765, Springer, pp. 386-397, 1993.
26. M. Matsui, On correlation between the order of S-boxes and the strength of DES, Eurocrypt'94, LNCS 950, pp. 366-375, Springer, 1995.
27. M.Matsui: The First Experimental Cryptanalysis of the Data Encryption Standard, Crypto'94, LNCS 839, Springer, pp. 1-11, 1994.
28. Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone: Handbook of Applied Cryptography, CRC Press, 1996.
29. J. Patarin, How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function. Eurocrypt'92,Springer, pp. 256-266, 1992.
30. Adi Shamir: On the security of DES, Crypto'85, LNCS 218, Springer, pp. 280-281, 1985.