H.R. Amirazizi and M.E. Hellman, "Time-Memory-Processor Tradeoffs", IEEE-IT, vol.34, no. 3 (1988), pp. 505-512. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Using Tadpoles to Reduce Memory and Communication.. - Cooperman, Tselman (1997) (1 citation) (Correct)
....it would suffice to enumerate all elements and then feed only those elements satisfying the desired criterion into the domain dependent application. Schroeder and Shamir formalize the term polynomially enumberable, and this has given rise to still another class of algorithms for exhaustive search [2, 14]. The result of this paper is particularly important for the case when the search space is not polynomially enumberable. We define a search space, S, as follows. We assume that S is represented by a connected undirected graph. We assume that the graph S is given to us in an implicit ....
H. Amirazizi and M. Hellman, "Time-Memory-Processor Trade-Offs", IEEE Transactions on Information Theory 34(3), 1988, pp. 505--512.
Discrete logarithms: The past and the future - Odlyzko (1999) (6 citations) (Correct)
....one can replace sorting by hashing, speeding up the process. On the other hand, there is no easy way to reduce space requirements (other than by increasing the running time) which are of order m jhgij 1=2 . For other examples of computational tradeoffs in cryptographic searches, see [AmiraziziH]] There are two other general algorithms for the discrete log problem that run in time O(jhgij 1=2 ) and very little space. Both methods are randomized and are due to Pollard [Pollard1] We sketch a version of one of those methods here. Let x 0 = 1 and for i 0 let x i 1 = 8 : x i h; ....
H. R. Amirazizi and M. E. Hellman, Time-memory-processor trade-offs, IEEE Trans. Inform. Theory 34 (1988), 505--512.
Parallel Collision Search with Cryptanalytic Applications - van Oorschot, Wiener (1996) (51 citations) (Correct)
No context found.
H.R. Amirazizi and M.E. Hellman, "Time-Memory-Processor Tradeoffs", IEEE-IT, vol.34, no. 3 (1988), pp. 505-512.
Improving Implementable Meet-in-the-Middle Attacks by.. - van Oorschot, Wiener (1996) (Correct)
No context found.
H.R. Amirazizi and M.E. Hellman, "Time-Memory-Processor Trade-Offs", IEEE Transactions on Information Theory, vol. 34, no. 3, May 1988.
Rigorous Time/Space Tradeoffs for Inverting Functions - Fiat, Naor (2000) (2 citations) (Correct)
No context found.
H. R. Amirazizi and M. E. Hellman, Time-memory-processor trade-off, IEEE Trans. Infor. Theory 34, 1988, pp. 505-512. 15
Rigorous Time/Space Tradeoffs for Inverting Functions - Fiat, Naor (2000) (2 citations) (Correct)
No context found.
H. R. Amirazizi and M. E. Hellman, Time-memory-processor trade-off, IEEE Trans. Infor. Theory 34, 1988, pp. 505-512.
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