Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude-Reference-Cited by-同舟云学术

Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude

Published:1996 Issue: Volume: Page:229-236
ISSN:0302-9743
Container-title:Advances in Cryptology — CRYPTO ’96
language:
Short-container-title:

Author:

van Oorschot Paul C.,Wiener Michael J.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-68697-5_18

Reference13 articles.

1. H.R. Amirazizi and M.E. Hellman, “Time-Memory-Processor Trade-Offs”, IEEE Transactions on Information Theory, vol. 34, no. 3, May 1988.

2. J. Burns and C.J. Mitchell, “Parameter Selection for Server-Aided RSA Computation Schemes”, IEEE Transactions on Computers, vol. 43, no. 2, Feb. 1994, pp. 163–174.

3. “Data Encryption Standard”, National Bureau of Standards (U.S.), Federal Information Processing Standards Publication (FIPS PUB) 46, National Technical Information Service, Springfield, Virginia, 1977.

4. D.E. Denning, Cryptography and Data Security, Addison Wesley, 1982.

5. W. Diffie and M. Hellman, “Exhaustive cryptanalysis of the NBS Data Encryption Standard”, Computer vol. 10 no.6 (June 1977) pp. 74–84.

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hybrid Meet-in-the-Middle Attacks for the Isogeny Path-Finding Problem;Proceedings of the 7th ACM Workshop on ASIA Public-Key Cryptography;2020-10-05

2. On the Cost of Computing Isogenies Between Supersingular Elliptic Curves;Selected Areas in Cryptography – SAC 2018;2019

3. Efficient Dissection of Bicomposite Problems with Cryptanalytic Applications;Journal of Cryptology;2018-08-21

4. Dissection;Communications of the ACM;2014-09-23

5. Collision Attacks on Up to 5 Rounds of SHA-3 Using Generalized Internal Differentials;Fast Software Encryption;2014