Abstract
Wu and Chang [1] propose a password authentication scheme based on discrete logarithms. In this correspondence, we will show that anyone who gets two pairs of <ID,PW> can break their scheme.
*Intern. J. Computer Math., Vol. 41, pp. 31-38, 1991.
*Intern. J. Computer Math., Vol. 41, pp. 31-38, 1991.
Notes
*Intern. J. Computer Math., Vol. 41, pp. 31-38, 1991.