Abstract
One of the ultimate goals of cryptography researchers is to construct a (secrete-key) block cipher which has the following ideal properties: (1) The cipher is provably secure, (2) Security of the cipher does not depend on any unproved hypotheses, (3) The cipher can be easily implemented with current technology, and (4) All design criteria for the cipher are made public. It is currently unclear whether or not there really exists such an ideal block cipher. So to meet the requirements of practical applications, the best thing we can do is to construct a block cipher such thai it approximates the ideal one as closely as possible. In this paper, we make a significant step in this direction. In particular, we construct several block ciphers each of which has the above mentioned properties (2), (3) and (4) as well as the following one: (1’) Security of the cipher is supported by convincing evidence. Our construction builds upon profound mathematical bases for information security recently established in a series of excellent papers.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Blum and S. Micali: “How to generate cryptographically strong sequences of pseudo-random bits,” SIAM Journal on Computing, Vol. 13, No. 4, (1984), pp.850–864.
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.
A.G. Konheim: Cryptography: A Primer, John Wiley & Sons, Inc. (1981).
L.A. Levin: “One-way functions and pseudorandom generators,” Combinatorica, Vol. 7, No. 4, (1987), pp.357–363.
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.
C.H. Meyer: “Ciphertext/plaintext and ciphertext/key dependence vs number of rounds for the data encryption standard,” AFIPS Conference Proceedings, Vol. 47, (1978), pp.1119–1126.
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, (1988).
R.A. Rueppel: “On the security of Schnorr’s pseudorandom generator,” Presented at 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.
Y. Zheng, T. Matsumoto and H. Imai: “Impossibility and optimality results on constructing pseudorandom permutations,” Presented at EUROCRYPT’89, Houthalen, (April 10–13, 1989).
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). On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses. In: Brassard, G. (eds) Advances in Cryptology — CRYPTO’ 89 Proceedings. CRYPTO 1989. Lecture Notes in Computer Science, vol 435. Springer, New York, NY. https://doi.org/10.1007/0-387-34805-0_42
Download citation
DOI: https://doi.org/10.1007/0-387-34805-0_42
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97317-3
Online ISBN: 978-0-387-34805-6
eBook Packages: Springer Book Archive