Author:
Iwata Tetsu,Yoshino Tomonobu,Yuasa Tomohiro,Kurosawa Kaoru
Publisher
Springer Berlin Heidelberg
Reference14 articles.
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. Lect Notes Comput Sci;S. Lucks,1996
4. Lect Notes Comput Sci;M. Matsui,1996
5. Lect Notes Comput Sci;M. Matsui,1997
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Security of the Misty Structure beyond the Birthday Bound;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2014
2. Security of the Misty Structure Using Involutions as Round Functions;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2010
3. Improving the Generalized Feistel;Fast Software Encryption;2010
4. Security Analysis of the GF-NLFSR Structure and Four-Cell Block Cipher;Information and Communications Security;2009
5. Pseudorandomness of Camellia-Like Scheme;Journal of Computer Science and Technology;2006-01