A. M. Odlyzko, June 1991. Private conversation. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Encrypted Key Exchange: Password-Based Protocols Secure.. - Bellovin, Merritt (1992) (147 citations) (Correct)
.... s algorithm[13] and that ff is a primitive root of GF (fi) The latter two conditions are related; we must know the factorization of fi Gamma 1 in order to validate ff. Requiring that fi be of the form kp 1, where p is prime and k a very small integer, solves both problems. Recent results[14] do suggest that it may be possible to choose a fi that contains a hidden trap door. At the moment, this attack does not seem to be practical. If that should change, other choices would, of course, be preferable. Thus far, we have said nothing about choosing ff. But if a suitable value of fi is ....
A. M. Odlyzko, June 1991. Private conversation.
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