A Switching Closure Test to Analyze Cryptosystems

Authors:
Hikaru Morita;Kazuo Ohta;Shoji Miyaguchi
Affiliations:
-;-;-
Venue:
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Year:
1991

Citing 7
Cited 5

Is the data encryption standard a group? (Results of cycling experiments on DES)

Journal of Cryptology
Random mapping statistics

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information

The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
How Easy is Collision Search. New Results and Applications to DES

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard

Computer
Riemann's hypothesis and tests for primality

Journal of Computer and System Sciences

DES is not a Group

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Preimages for Reduced SHA-0 and SHA-1

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Cryptanalysis of Twister

ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Finding preimages of tiger up to 23 steps

FSE'10 Proceedings of the 17th international conference on Fast software encryption
Investigating fundamental security requirements on whirlpool: improved preimage and collision attacks

ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security

Quantified Score

Hi-index	0.00

Visualization

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.