Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 229-236
- https://doi.org/10.1007/3-540-68697-5_18
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Note on Discrete Logarithms with Special StructurePublished by Springer Nature ,2001
- Attacks on Protocols for Server-Aided RSA ComputationPublished by Springer Nature ,2001
- Parallel collision search with application to hash functions and discrete logarithmsPublished by Association for Computing Machinery (ACM) ,1994
- Parameter selection for server-aided RSA computation schemesIEEE Transactions on Computers, 1994
- Time-memory-processor trade-offsIEEE Transactions on Information Theory, 1988
- On the power of cascade ciphersACM Transactions on Computer Systems, 1985
- A cryptanalytic time-memory trade-offIEEE Transactions on Information Theory, 1980
- Monte Carlo Methods for Index Computation (mod p)Mathematics of Computation, 1978
- Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption StandardComputer, 1977
- A monte carlo method for factorizationBIT Numerical Mathematics, 1975