Abstract
The closure test MCT (meet-in-the-middle closure test) was introduced to analyze the algebraic properties of cryptosystems [KaRiSh]. Since MCT needs a large amount of memory, it is hard to implement with an ordinary meet-in-the-middle method. As a feasible version of MCT, this paper presents a switching closure test SCT which based on a new memoryless meet-in-the-middle method. To achieve the memoryless method, appropriate techniques, such as expansion of cycling detection methods for one function into a method for two functions and an efficient intersection search method that uses only a small amount of memory, are used in an extremely effective manner.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
W. Diffie and M. E. Hellman: “Exhaustive Cryptanalysis of the NBS Data Encryption Standard,” Computer, 10,6, pp.74–84, June 1977.
P. Flajolet and A. M. Odlyzko: “Random Mapping Statistics,” Advances in Cryptology-EUROCRYPT’89, Proceedings, pp.329–354, Springer-Verlag, 1990.
B. S. Kaliski Jr., R. L. Rivest, and A. T. Sherman: “Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES),” J. Cryptology, 1,1, pp.3–36, 1988.
D. E. Knuth: Exercise 3.1 No. 7, “The Art of Computer Programming 2nd ed. (Seminumerical Algorithms),” Addison-Wesley, 1981.
G. L. Miller: “Riemann’s hypothesis and tests for primality,” J. Computer and System Science, 13, pp.300–317, 1976.
J.-J. Quisquater and J.-P. Delescaille: “How Easy is Collision Search. New Results and Applications to DES,” Advances in Cryptology-CRYPTO’89, Proceedings, pp.408–413, Springer-Verlag, 1990.
R. L. Rivest, A. Shamir, and L. Adleman: “A Method of Obtaining Digital Signatures and Public Key Cryptosystems,” Comm. of ACM, pp.120–126, Feb. 1978.
R. Sedgewick, T. G. Szymanski, and A. C. Yao: “The Complexity of Finding Cycles in Periodic Functions,” SIAM J. Comp., 11,2, pp.376–390, May 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morita, H., Ohta, K., Miyaguchi, S. (1992). A switching closure test to analyze cryptosystems. In: Feigenbaum, J. (eds) Advances in Cryptology — CRYPTO ’91. CRYPTO 1991. Lecture Notes in Computer Science, vol 576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46766-1_13
Download citation
DOI: https://doi.org/10.1007/3-540-46766-1_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55188-1
Online ISBN: 978-3-540-46766-3
eBook Packages: Springer Book Archive