S. Pohlig and M. E. Hellman, "An improved algorithm May 1976.  Home/Search   Document Not in Database   Summary   Related Articles

....400 multiplications are required to compute Y i and, for certain carefully chosen values of q, requires on the from X ,orK ij from Y i and X j , yet taking logs mod q requires order of q 1 2 operations, using the best known ithm [7, pp. 9, 2 100 or approximately 10 30 operations. 575 576] [8]. The security of our technique depends crucially on the seculty of computing logarithms mod q, and if an algorithm whose 4 ONE WAY AUTHENTICATION complexity grew as log 2 q were to be found, our m would be broken. While the simplicity of the problem statement might The problem of authentication ....

....its inverse images m. It must be hard even given m to find a different inverse image one way functions to yield a good cryptosystem. This actually happened with the discrete exponential function discussed in of m8. Finding such functions appears to offer little trouble (see Section V) Section III [8]. One way functions are basic to both block ciphers and key There is another partial solution to the one way user authentication problem. The user generates a password which he keeps generators. A key generator is a pseudorandom bit generator whose output, the keystream, is added modulo 2 to a ....

S. Pohlig and M. E. Hellman, "An improved algorithm May 1976.

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