Round security and super-pseudorandomness of MISTY type structure

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

Volumn 2355, Issue , 2002, Pages 233-247

  Iwata, Tetsu ^a   Yoshino, Tomonobu ^a   Yuasa, Tomohiro ^a   Kurosawa, Kaoru ^a  

^a Tokyo Institute of Technology ^*  (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DIFFERENTIAL CRYPTANALYSIS; FEISTEL STRUCTURES; LINEAR CRYPTANALYSIS; PSEUDO RANDOM; PSEUDORANDOMNESS; RANDOM FUNCTIONS; ROUND FUNCTIONS; TYPE STRUCTURES;

CRYPTOGRAPHY;

EID: 84958961922     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45473-X_20     Document Type: Conference Paper

References (14)

1. J.L. Carter and M.N. Wegman. Universal classes of hash functions. JCSS, vol. 18, No. 2, pages 143–154, 1979.
2. M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput., vol. 17, No. 2, pages 373–386, April 1988.
3. S. Lucks. Faster Luby-Rackoff ciphers. Fast Software Encryption, FSE’96, LNCS 1039, pages 189–203, Springer-Verlag.
4. M. Matsui. New structure of block ciphers with provable security against differential and linear cryptanalysis. Fast Software Encryption, FSE’96, LNCS 1039, pages 206–218, Springer-Verlag.
5. M. Matsui. New block encryption algorithm MISTY. Fast Software Encryption, FSE’97, LNCS 1267, pages 54–68, Springer-Verlag.
6. M. Naor and O. Reingold. On the construction of pseudorandom permutations: Luby-Rackoff revised. J. Cryptology, vol. 12, No. 1, pages 29–66, Springer-Verlag, 1999.
7. K. Nyberg and L.R. Knudsen. Provable security against a differential attacks. J. Cryptology, vol. 8, No. 1, pages 27–37, Springer-Verlag, 1995.
8. J. Patarin. Pseudorandom permutations based on the DES scheme. Proceedings of Eurocode’90, LNCS 514, pages 193–204, Springer-Verlag, 1990.
9. J. atarin. New results of pseudorandom permutation generators based on the DES scheme. Advances in Cryptology — CRYPTO’91, LNCS 576, pages 301–312, Springer-Verlag, 1991.
10. Z. Ramzan and L. Reyzin. On the round security of symmetric-key cryptographic primitives. Advances in Cryptology — CRYPTO 2000, LNCS 1880, pages 376–393, Springer-Verlag, 2000.
11. K. Sakurai and Y. Zheng. On non-pseudorandomness from block ciphers with provable immunity against linear cryptanalysis. IEICE Trans. fundamentals, vol. E80-A, No. 1, pages 19–24, April 1997.
12. M. Sugita. Pseudorandomness of a block cipher MISTY. Technicalr eport of IEICE, ISEC 96-9, pages 13–21, 1996.
13. M. Sugita. Pseudorandomness of block ciphers MISTY1. Technicalr eport of IEICE, ISEC 97-19, pages 53–64, 1997.
14. M.N. Wegman and J.L. Carter. New hash functions and their use in authentication and set equality. JCSS, vol. 22, No. 3, pages 265–279, 1981.