Summary
Let I n = {0, 1}n, and H n be the set of all functions from I n to I n. For f ∈ H n, define the DES-like transformation associated with f by F 2n, f (L, R) = (R ⊕ f(L), L), where L, R ε I n. For f 1, f 2, ..., f s ∈ H n, define Ψ(f s, ..., f 2, f 1) = F 2n,fs, ∘ ... ∘ F 2n,f2 ∘ F 2n,f1. Our main result is that Ψ(f k, f j, f i) is not pseudorandom for any positive integers i, j, k, where f i denotes the i-fold composition of f. Thus, as immediate consequences, we have that (1) none of Ψ(f, f, f), Ψ(f, f, f 2) and Ψ(f 2, f, f) are pseudorandom and, (2) Ohnishi’s constructions Ψ(g, g, f) and Ψ(g, f, f) are optimal. Generalizations of the main result are also considered.
Chapter PDF
Similar content being viewed by others
References
H. Feistel, W. A. Notz and J. L. Smith: “Some cryptographic techniques for machine-to-machine data communications,” Proceedings of IEEE, Vol. 63, No. 11, (1975), pp.1545–1554.
O. Goldreich, S. Goldwasser and S. Micali: “How to construct random functions,” Journal of ACM, Vol. 33, No. 4, (1986), pp.792–807.
M. Luby and C. Rackoff: “How to construct pseudorandom permutations from pseudorandom functions,” SIAM Journal on Computing, Vol. 17, No. 2, (1988), pp.373–386. (A preliminary version including other results appeared in Proceedings of the 18th ACM Symposium on Theory of Computing, (1986), pp.356–363.)
Data Encryption Standard, Federal Information Processing Standards (FIPS) Publication 46, National Bureau of Standards, U.S. Department of Commerce, (1977).
Y. Ohnishi: “A study on data security,” Master Thesis (in Japanese), Tohoku University, Japan, (March, 1988).
R. A. Rueppel: “On the security of Schnorr’s pseudorandom generator,” Abstracts of EUROCRYPT’89, Houthalen, (April 10–13, 1989).
C. P. Schnorr: “On the construction of random number generators and random function generators,” Advances in Cryptology — EUROCRYPT’88, LNCS Vol. 330, Springer-Verlag, (1988), pp.225–232.
A.C. Yao: “Theory and applications of trapdoor functions,” Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, (1982), pp.80–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, Y., Matsumoto, T., Imai, H. (1990). Impossibility and Optimality Results on Constructing Pseudorandom Permutations. In: Quisquater, JJ., Vandewalle, J. (eds) Advances in Cryptology — EUROCRYPT ’89. EUROCRYPT 1989. Lecture Notes in Computer Science, vol 434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46885-4_41
Download citation
DOI: https://doi.org/10.1007/3-540-46885-4_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53433-4
Online ISBN: 978-3-540-46885-1
eBook Packages: Springer Book Archive