Improving implementable meet-in-the-middle attacks by orders of magnitude

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1109, Issue , 1996, Pages 229-236

  Van Oorschot, Paul C ^a   Wiener, Michael J ^a  

^a NORTEL NETWORKS   (Canada)

Author keywords

Aptanalysis; DES; Low hamming weight exponents; Meet in the middle attack; Parallel collision search

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

APTANALYSIS; CARDINALITIES; KNOWN-PLAINTEXT ATTACKS; LOW HAMMING WEIGHTS; MEET-IN-THE-MIDDLE ATTACKS; MEMORY ACCESS; ORDERS OF MAGNITUDE; PARALLEL COLLISION SEARCH;

CRYPTOGRAPHY;

EID: 84955586695     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68697-5_18     Document Type: Conference Paper

References (13)

1. H.R. Amirazizi and M.E. Heilman, "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. Heilman, "Exhaustive cryptanalysis of the NBS Data Encryption Standard," Computer vol. 10 No.6 (June 1977) pp. 74-84.
6. S. Even and O. Goldreich, "On the Power of Cascade Ciphers," ACM Transactions on Computer Systems, vol. 3, no. 2, May 1985.
7. P. Flajolet and A.M Odlyzko, "Random Mapping Statistics," Lecture Notes in Computer Science 434: Advances in Cryptology - Eurocrypt '89 Proceedings, Springer-Verlag, pp. 329-354.
8. R Heiman, "A note on discrete logarithms with special structure," Lecture Notes in Computer Science 658: Advances in Cryptology - Eurocrypt '92, Springer-Verlag, pp. 454-457.
9. M.E. Heilman, "A cryptanalytic time-memory trade-off', IEEE Transactions on Information Theory, vol.6 (1980), pp. 401-406.
10. B. Pfitzmann and M. Waidner, "Attacks on Protocols for Server-Aided RSA Computation," Lecture Notes in Computer Science 658: Advances in Cryptology - Eurocrypt '92, Springer-Verlag, pp. 153-162.
11. J.M. Pollard, "A Monte Carlo method for factorization," BIT, vol. 15 (1975), pp. 331-334.
12. J.M. Pollard, "Monte Carlo Methods for Index Computation (mod p)," Mathematics of Computation, vol. 32, no. 143, July 1978, pp. 918-924.
13. P.C. van Oorschot and M.J. Wiener, "Parallel Collision Search with Application to Hash Functions and Discrete Logarithms." 2nd ACM Conference on Computer and Communications Security, Fairfax, Virginia, November 1994, pp. 210-218.