Methods to solve discrete logarithm problem for ephemeral keys

ARTCom 2009 - International Conference on Advances in Recent Technologies in Communication and Computing

Volumn , Issue , 2009, Pages 704-708

  Padmavathy, R ^a   Bhagvati, Chakravarthy ^b  

^a NATIONAL INSTITUTE OF TECHNOLOGY   (India)

^b UNIVERSITY OF HYDERABAD   (India)

Author keywords

Chang Chang password key exchange protocol; Ephemeral key; Index calculus method

Indexed keywords

DISCRETE LOGARITHM PROBLEMS; INDEX CALCULUS; KEY EXCHANGE PROTOCOLS; MATHEMATICAL PROBLEMS; POHLIG-HELLMAN; PRE-COMPUTATION; PRIME FIELD; PUBLIC KEY CRYPTOSYSTEMS;

CALCULATIONS; KEYS (FOR LOCKS); PUBLIC KEY CRYPTOGRAPHY;

ALGEBRA;

EID: 73849097524     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ARTCom.2009.62     Document Type: Conference Paper

References (17)

1. Knuth, D.E, The Art of computer programming,vol.3:Sorting and Searching, Addison-Wesley, 1973.
2. Pollard. J.M, Monte Carlo methods for index computation (mod p), Mathematics of Computation, vol.32 no.143,(1978) pp.106-110.
3. Pohlig, S and Hellman, M, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Transaction on Infomation Theory, vol.24,(1978) pp 106-110.
4. Coppersmith, D., Odlyzko, A.M and Schroeppel, R Discrete logarithms in GF(p), Algorithmica, vol.1,(1986) pp 1-15.
5. Gordon, D.M, Discrete logarithms in GF(p) using the number field sieve, SIAM Journal of Discrete Mathematics, vol.6(1992), pp124-138.
6. Schirokauer, O., Weber, D., Denny, T, Discrete logarithms the effectiveness of the index calculus method, Proceeding of ANTS II, LNCS vol.1122(1996) , pp 337-361.
7. Weber, D, Computing Discrete logarithms with the general number field sieve, Proceeding of ANTS II, LNCS vol.1122(1996), pp 99-114.
8. Weber, D., Denny, T, The solution of McCurleys discrete log challenge, Proceeding of Crypto98, LNCS vol.1462 , pp 458-471.
9. Studholme, C, Discrete logarithm problem, Research paper requirement (milestone) of the PhD program at the University of Toronto ,June 21,2002..
10. Buchmann, J., Weber, D, Discrete Logarithms:Recent Progress., Technical report, no:T1-12/98..
11. McCurely, The Discrete logarithm problem, C.Pomerance,editor, Crptology and computational number theory proceeding of symposia in Applied Mathematics, vol42, pp 49-74.
12. Cohen, H., Fery, G, 'Handbook of Elliptic and Hyperelliptic Curve Cryptography', Discrete Mathematics and Applications, CRC Press, 2005.
13. Silverman, J, The xedni calculus and the elliptic curve logarithm problem, Design Codes and Cryptography, vol:20,pp 5-40, 2000.
14. Menezes, A., Berkant U, On Reusing Ephemeral Keys in Diffie-Hellman Key Agreement Protocols, preprint, (2008)
15. CC. Chang., YF. Chang, A novel three party encrypted key exchange protocol, Computer Standards and Interfaces, 26(5):471-6:2004.
16. Fuw-Yi Yang, Improvement on a Trap door Hash Function, International Journal on Network Security, Vol 9, No 1, pp 17-21, (2009).
17. Var Oorschot, P.C and Wiener, M.J, On Diffie-Hellman Key agreement with short Exponents, Proceeding of Eurocrypt LNCS 1070, Springer Verlag, 332-343 (1996)