Paul C. van Oorschot, Michael J. Wiener  Home/Search
Context
Related
| scs.carleton.ca/~paulv/pa...Crypto96.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: scs.carleton.ca/~paulv/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Meet-in-the-middle attacks, where problems and the secrets being sought are decomposed into two pieces, have many applications in cryptanalysis. A well-known such attack on double-DES requires 2 time and memory; a naive key search would take 112 time. However, when the attacker is limited to a practical amount of memory, the time savings are much less dramatic. For n the cardinality of the space that each half of the secret is chosen from (n=2 for double-DES), and w the number of... (Update)
Active bibliography (related documents): More All
0.3: Parallel Collision Search with Cryptanalytic Applications - van Oorschot, Wiener (1996) (Correct)
0.3: On Diffie-Hellman Key Agreement with Short Exponents - van Oorschot, Wiener (1996) (Correct)
0.3: Sparse RSA Secret Keys and Their Generation - Lim, Lee (1996) (Correct)
Similar documents based on text: More All
0.5: A Known-Plaintext Attack on Two-Key Triple Encryption - van Oorschot, Wiener (1990) (Correct)
0.2: Authentication and Authenticated Key Exchanges - Diffie, van Oorschot, Wiener (1992) (Correct)
0.2: MDx-MAC and Building Fast MACs from Hash Functions - Preneel, van Oorschot (1995) (Correct)
BibTeX entry: (Update)
@article{ vanoorschot96improving,
author = "Paul C. van Oorschot and Michael J. Wiener",
title = "Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude",
journal = "Lecture Notes in Computer Science",
volume = "1109",
pages = "229--??",
year = "1996",
url = "citeseer.ist.psu.edu/vanoorschot96improving.html" }
Citations (may not include all citations):244 Cryptography and Data Security (context) - Denning - 1982
62 Federal Information Processing Standards Publication (context) - Standard, of - 1977
58 Monte Carlo Methods for Index Computation (mod p (context) - Pollard - 1978
51 Exhaustive cryptanalysis of the NBS Data Encryption Standard (context) - Diffie, Hellman - 1977
42 Random Mapping Statistics - Flajolet, Odlyzko
32 A Monte Carlo method for factorization (context) - Pollard - 1975
24 A cryptanalytic time-memory trade-off (context) - Hellman - 1980
20 Attacks on Protocols for Server-Aided RSA Computation - Pfitzmann, Waidner
17 Parallel Collision Search with Application to Hash Functions.. (context) - van Oorschot, Wiener - 1994
13 Parameter Selection for Server-Aided RSA Computation Schemes (context) - Burns, Mitchell - 1994
8 the Power of Cascade Ciphers (context) - Even, Goldreich - 1985
6 Time-Memory-Processor Trade-Offs (context) - Amirazizi, Hellman - 1988
4 A note on discrete logarithms with special structure (context) - Heiman
Documents on the same site (http://www.scs.carleton.ca/~paulv/papers/): More
Authentication and Authenticated Key Exchanges - Diffie, van Oorschot, Wiener (1992) (Correct)
Addressing Online Dictionary Attacks with Login.. - Stubblebine, van.. (2004) (Correct)
Security Analysis of the Message Authenticator Algorithm.. - Preneel, Rijmen, van.. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC