On the Universal Hash Functions in Luby-Rackoff Cipher

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E87-A, Issue 1, 2004, Pages 60-66

  Iwata, Tetsu ^a   Kurosawa, Kaoru ^a  

^a IBARAKI UNIVERSITY   (Japan)

Author keywords

Block cipher; Cryptography; Feistel permutation; Super pseudorandomness

Indexed keywords

COMPUTATIONAL METHODS; FUNCTIONS; MATHEMATICAL MODELS; RANDOM PROCESSES;

BLOCK CIPHER; FEISTEL PERMUTATION; SUPER-PSEUDORANDOMNESS;

CRYPTOGRAPHY;

EID: 0842267156     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (19)

1. J.L. Carter and M.N. Wegman, "Universal classes of hash functions," J. Comput. Syst. Sci., vol.18, no.2, pp.143-154, 1979.
2. M. Luby and C. Rackoff, "How to construct pseudorandom permutations from pseudorandom functions," SIAM J. Comput., vol.17, no.2, pp.373-386, April 1988.
3. S. Lucks, "Faster Luby-Rackoff ciphers," Fast Software Encryption, FSE'96, LNCS 1039, pp. 189-203, Springer-Verlag, 1996.
4. M. Naor and O. Reingold, "On the construction of pseudorandom permutations: Luby-Rackoff revised," J. Cryptology, vol.12, no.1, pp.29-66, Springer-Verlag, 1999.
5. Y. Ohnishi, A study on data security, Master's Thesis, Tohoku University, 1988.
6. J. Patarin, "Pseudorandom permutations based on the DES scheme," Proc. EUROCODE'90, LNCS 514, pp.193-204, Springer-Verlag, 1990.
7. J. Patarin, "New results of pseudorandom permutation generators based on the DES scheme," Advances in Cryptology - CRYPTO'91, LNCS 576, pp.301-312, Springer-Verlag, 1991.
8. J. Patarin, "How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function," Advances in Cryptology - EUROCRYPT'92, LNCS 658, pp.256-266, Springer-Verlag, 1992.
9. S. Patel, Z. Ramzan, and G. Sundaram, "Towards making Luby-Rackoff ciphers optimal and practical," Fast Software Encryption, FSE'99, LNCS 1636, pp.171-185, Springer-Verlag, 1999.
10. S. Patel, Z. Ramzan, and G. Sundaram, "Luby-Rackoff ciphers: Why XOR is not so exclusive," Selected Areas in Cryptography, SAC 2002, LNCS 2595, pp.271-290, Springer-Verlag, 2003.
11. J. Pieprzyk, "How to construct pseudorandom permutations from single pseudorandom functions," Advances in Cryptology - EUROCRYPT'90, LNCS 473, pp.140-150, Springer-Verlag, 1990.
12. Z. Ramzan and L. Reyzin, "On the round security of symmetric-key cryptographic primitives," Advances in Cryptology - CRYPTO 2000, LNCS 1880, pp.376-393, Springer-Verlag, 2000.
13. R.A. Rueppel, "On the security of Schnorr's pseudorandom generator," Advances in Cryptology - EUROCRYPT'89, LNCS 434, pp.423-428, Springer-Verlag, 1989.
14. B. Sadeghiyan and J. Pieprezyk, "On necessary and sufficient conditions for the construction of super pseudorandom permutations," Advances in Cryptology - ASIACRYPT'91, LNCS 739, pp.194-209, Springer-Verlag, 1991.
15. B. Sadeghiyan and J. Pieprezyk, "A construction of super pseudorandom permutations from a single pseudorandom function," Advances in Cryptology - EUROCRYPT'92, LNCS 658, pp.267-284, Springer-Verlag, 1992.
16. C.P. Schnorr, "On the construction of random number generators and random function generators," Advances in Cryptology - EUROCRYPT'88, LNCS 330, pp.225-232, Springer-Verlag, 1988.
17. D.R. Stinson, "On the connections between universal hashing, combinatorial designs and error-correcting codes," Congressus Numerantium, vol.114, pp.7-27, 1996.
18. M.N. Wegman and J.L. Carter, "New hash functions and their use in authentication and set equality," J. Comput. Syst. Sci., vol.22, no.3, pp.265-279, 1981.
19. Y. Zheng, T. Matsumoto, and H. Imai, "Impossibility and optimality results on constructing pseudorandom permutations," Advances in Cryptology - EUROCRYPT'89, LNCS 434, pp.412-422, Springer-Verlag, 1990.