On the construction of block ciphers provably secure and not relying on any unproved hypotheses

144Citations
Citations of this article
61Readers
Mendeley users who have this article in their library.

This article is free to access.

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 that 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.

Cite

CITATION STYLE

APA

Zheng, Y., Matsumoto, T., & Imai, H. (1990). On the construction of block ciphers provably secure and not relying on any unproved hypotheses. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 435 LNCS, pp. 461–480). Springer Verlag. https://doi.org/10.1007/0-387-34805-0_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free