EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Parallel collision search with application to hash functions and discrete logarithms
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
On the power of cascade ciphers
ACM Transactions on Computer Systems (TOCS)
Parameter Selection for Server-Aided RSA Computation Schemes
IEEE Transactions on Computers
Attacks on protocols for server-aided RSA computation
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
State of the Art in Applied Cryptography, Course on Computer Security and Industrial Cryptography - Revised Lectures
Cryptanalysis of Some Recently-Proposed Multiple Modes of Operation
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
Cryptanalytic Attacks on Pseudorandom Number Generators
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
On the Security of Double and 2-Key Triple Modes of Operation
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
On Security of the 128-Bit Block Cipher DEAL
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
The Carry Leakage on the Randomized Exponent Countermeasure
CHES '08 Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems
Improved Generic Algorithms for 3-Collisions
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Improved generic algorithms for hard knapsacks
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Memoryless near-collisions via coding theory
Designs, Codes and Cryptography
Second preimages on n-bit hash functions for much less than 2n work
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
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 256 time and memory; a naive key search would take 2112 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=256 for double-DES), and w the number of words of memory available for an attack, a technique based on parallel collision search is described which requires O(√n/w) times fewer operations and O(n/w) times fewer memory accesses than previous approaches to meet-in-the-middle attacks. For the example of double-DES, an attacker with 16 Gbytes of memory could recover a pair of DES keys in a known-plaintext attack with 570 times fewer encryptions and 3.7×106 times fewer memory accesses compared to previous techniques using the same amount of memory.