| R. C. Merkle and M. E. Hellman, Hiding information and signatures in trapdoor functions, IEEE Trans. Infor. Theory 24, 1978, pp. 525-530. |
....Supported by a grant from the Israel Science Foundation administered by the Israel Academy of Sciences. E mail: naor wisdom.weizmann.ac.il. 1 Introduction Time space tradeoffs occur in many searching tasks. Typical examples are a TS O(2 n ) time space tradeoff for knapsack like problems [15, 17, 10], algorithms for solving the discrete log problem [16] etc. In this paper we investigate time space tradeoffs for inverting functions. Hellman [12] was the first to study this problem. He suggests a general time space tradeoff to invert one way functions. Let the domain be D = f1; Ng and ....
R. C. Merkle and M. E. Hellman, Hiding information and signatures in trapdoor functions, IEEE Trans. Infor. Theory 24, 1978, pp. 525-530.
....and a grant from the Israel Science Foundation administered by the Israel Academy of Sciences. E mail: naor wisdom.weizmann.ac.il. 1 Introduction Time space tradeoffs occur in many searching tasks. Typical examples are a TS 2 = O(2 n ) time space tradeoff for knapsack like problems [14, 16, 9], algorithms for solving the discrete log problem [15] etc. In this paper we investigate time space tradeoffs for inverting functions. Hellman [11] was the first to study this problem. He suggests a general time space tradeoff to invert one way functions. Let the domain be D = f1; Ng and ....
R. C. Merkle and M. E. Hellman, Hiding information and signatures in trapdoor functions, IEEE Trans. Infor. Theory 24, 1978, pp. 525-530.
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