1 |
R. Padmavathy, and Chakravarthy Bhagvati, "A Key Recovery Attack on Chang and Chang Password Key Exchange Protocol," International Conference on Computer and Network Technology, 2009.
|
2 |
J. M Pollard, "Monte Carlo methods for index computation (mod p)," Mathematics of Computation., v32(143), pp.106-110, 1978.
|
3 |
S. Pohlig, and M. Hellman, "An improved algorithm for computing logarithms over GF(p) and its cryptographic significance," IEEE Transaction on Information Theory, v24, pp.106-110, 1978.
DOI
|
4 |
J. Silverman, "The xedni calculus and the elliptic curve logarithm problem," Design Codes and Cryptography, v20, pp.5-40, 2000.
DOI
|
5 |
O. Schirokauer, D.Weber and T. Denny, "Discrete logarithms the effectiveness of the index calculus method," Proceeding of ANTS II, LNCS v1122, pp.337-361, 1996.
|
6 |
C. Studholme, Discrete logarithm problem, Research paper requirement (milestone) of the PhD program at the University of Toronto, June 21, 2002.
|
7 |
P. C, Van Oorschot and M. J, Wiener, "On Diffie-Hellman Key agreement with short Exponents," Proceeding of Eurocrypt LNCS v1070, pp.332-343, 1996
|
8 |
D. Weber, "Computing Discrete logarithms with the general number field sieve," Proceeding of ANTS II, LNCS v1122, pp.99-114, 1996.
|
9 |
D.Weber and T. Denny, The solution of McCurleys discrete log challenge, Proceeding of Crypto98, LNCS v1462, pp.458-471, 1998.
|
10 |
EJ. Yoon and KY. Yoo, "Improving the novel three-party encrypted key exchange protocol," Computer Standards and Interfaces, v30, pp.309-314, 2008.
DOI
ScienceOn
|
11 |
J. Buchmann and D. Weber, “Discrete Logarithms:Recent Progress,” Technical report, no:T1-12/98.
|
12 |
H. Cohen, and G. Fery, ‘Handbook of Elliptic and Hyperelliptic Curve Cryptography,' Discrete Mathematics and Applications, CRC Press, 2005.
|
13 |
D. Coppersmith, A. M Odlyzko, and R. Schroeppel, "Discrete logarithms in GF(p)," Algorithmica, v1, pp.1-15, 1986.
DOI
|
14 |
CC. Chang., YF. Chang, "A novel three party encrypted key exchange protocol," Computer Standards and Interfaces, v26(5), pp.471-6, 2004.
DOI
ScienceOn
|
15 |
W. Diffie, and M. Hellman, "New Directions in cryptography," IEEE Transaction on Information The ory, v22(6), pp.644-54, 1976.
DOI
|
16 |
D. M Gordon, "Discrete logarithms in GF(p) using the number field sieve," SIAM Journal of Discrete Mathematics, v6, pp.124-138, 1992.
DOI
|
17 |
D. E Knuth, The Art of computer programming,vol.3:Sorting and Searching, Addison-Wesley, 1973.
|
18 |
McCurely, "The Discrete logarithm problem," Cryptology and computational number theory proceeding of symposia in Applied Mathematics, v42, pp.49-74.
|
19 |
A. Menezes, and U. Berkant, On Reusing Ephemeral Keys in Diffie-Hellman Key Agreement Protocols, preprint, 2008.
|