A family of trapdoor ciphers

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

Volumn 1267, Issue , 1997, Pages 139-148

  Rijmen, Vincent ^a   Preneel, Bart ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

LYAPUNOV METHODS; SECURITY OF DATA;

BLOCK CIPHERS; CIPHERTEXTS; HIDDEN STRUCTURES; LINEAR CRYPTANALYSIS; PUBLIC-KEY ENCRYPTION SCHEME;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84947909705     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0052342     Document Type: Conference Paper

References (15)

1. C.M. Adams, S.E. Tavares, Designing S-boxes for ciphers resistant to differential cryptanalysis, Proceedings of the 3rd Symposium on State and Progress of Research in Cryptography, W. Wolfowicz, Ed., Fondazione Ugo Bordoni, 1993, pp. 181-190.
2. K.G. Beauchamp, Walsh Functions and Their Applications, Academic Press, New York, 1975.
3. E. Biham, A. Shamir, Differential Cryptanalysis of the Data Encryption Standard, Springer-Verlag, 1993.
4. A. Blum, M. Fürst, M. Kearns, R.J. Lipton, "Cryptographic primitives based on hard learning problems," Advances in Cryptology, Proceedings Crypto'93, LNCS 773, D. Stinson, Ed., Springer-Verlag, 1994, pp. 278-291.
5. L. Brown, M. Kwan, J. Pieprzyk, J. Seberry, "Improving resistance against differential cryptanalysis and the redesign of LOKI," Advances in Cryptology, Proceedings Asiacrypt'91, LNCS 739, H. Imai, R.L. Rivest, and T. Matsumoto, Eds., Springer-Verlag, 1993, pp. 36-50.
6. D. Coppersmith, S. Winograd, "Matrix multiplication via arithmetic progressions," Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 1987, pp. 1-6.
7. J.F. Dillon, "Elementary Hadamard difference sets," Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, Congressum Numerantium No. XIV, Utilitas Math., Winnipeg, Manitoba, 1975, pp. 237-249.
8. H. Feistel, W.A. Notz, J.L. Smith, "Some cryptographic techniques for machine- to-machine data communications," Proceedings IEEE, Vol. 63, No. 11, November 1975, pp. 1545-1554.
9. FIPS 46, Data Encryption Standard, NBS, U.S. Department of Commerce, Washington D.C., Jan. 1977.
10. H.M. Heys, S.E. Tavares, On the security of the CAST encryption algorithm, Canadian Conference on Electrical and Computer Engineering, pp. 332-335, Sept. 1994, Halifax, Canada.
11. L.R. Knudsen, M.J.B. Robshaw, "Non-linear approximations in linear cryptanalysis," Advances in Cryptology, Proceedings Eurocrypt'96, LNCS 1070, U. Maurer, Ed., Springer-Verlag, 1996, pp. 224-236.
12. A.K. Lenstra, H.W. Lenstra, Jr., L. Lovász, "Factoring polynomials with rational coefficients," Math. Annalen, No. 261, pp. 513-534, 1982.
13. M. Matsui, "On correlation between the order of S-boxes and the strength of DES," Advances in Cryptology, Proceedings Eurocrypt'94, LNCS 950, A. De Santis, Ed., Springer-Verlag, 1995, pp. 366-375.
14. M. Matsui, "The first experimental cryptanalysis of the Data Encryption Standard," Advances in Cryptology, Proceedings Crypto'94, LNCS 839, Y. Desmedt, Ed., Springer-Verlag, 1994, pp. 1-11.
15. M.E. Smid, D.K. Branstad, "The Data Encryption Standard. Past and future," in "Contemporary Cryptology: The Science of Information Integrity," G.J. Simmons, Ed., IEEE Press, 1991, pp. 43-64.