Performance analysis of index calculus method

References

• Knuth , D. E. 1973 . The Art of Computer Programming, Vol. 3: Sorting and Searching , Addison-Wesley .
   Google Scholar
• Pollard , J. M. 1978 . Monte Carlo methods for index computation (mod p) . Mathematics of Computation , 32 ( 143 ) : 106 – 110 .
   Google Scholar
• Pohlig , S. and Hellman , M. 1978 . An improved algorithm for computing logarithms over GF(p) and its cryptographic significance . IEEE Trans. Information Theory , 24 : 106 – 110 .
   Web of Science ®Google Scholar
• Coppersmith , D. , Odlyzko , A. M. and Schroeppel , R. 1986 . Discrete logarithms in GF(p) . Algorithmica , 1 : 1 – 15 .
   Web of Science ®Google Scholar
• LaMacchia , B. A. and Odllyzko , A. M. 1991 . Computation of discrete logarithms in prime fields . Designs, Codes and Cryptography , 1 : 46 – 62 .
   Google Scholar
• Das , A. and Veni Madhavan , C. E. 2005 . On the cubic sieve method for computing discrete logarithms over prime fields . International Journal of Computer Mathematics , 82 ( 12 ) : 481 – 1495 .
   Google Scholar
• Gordon , D. M. 1993 . Discrete logarithms in GF(p) using the number field sieve . SIAM Journal of Discrete Mathematics , 6 : 124 – 138 .
   Web of Science ®Google Scholar
• Schirokauer , O. , Weber , D. and Denny , T. 1996 . Discrete logarithms, the effectiveness of the index calculus method . Proceeding of ANTS II, LNCS , 122 : 337 – 361 .
   Google Scholar
• Weber , D. 1996 . Computing discrete logarithms with the general number field sieve . Proceeding of ANTS II, LNCS , 1122 : 99 – 114 .
   Google Scholar
• Weber , D. and Denny , T. 1998 . The solution of McCurleys discrete log challenge . Proceeding of Crypto98, LNCS , 1462 : 458 – 471 .
   Google Scholar
• Hildebrand , A. 1986 . On the number of positive integers < x and free of prime factors > y . Journal of Number Theory , 22 : 289 – 307 .
   Web of Science ®Google Scholar
• Hildebrand , A. and Tenenbaum , G. 1986 . On integers free of large prime factors . Trans. AMS , 296 : 1265 – 1290 .
   Google Scholar
• Hunter , S. and Sorenson , J. 1997 . Approximating the number of integers free of large prime factors . Mathematics of Computation , 66 ( 220 ) : 1729 – 1741 .
   Google Scholar
• Berstein , D. J. 2002 . Arbitrarily tight bounds on the distribution of smooth integers . Number Theory for the Millennium I , : 49 – 66 .
   Google Scholar
• Berstein , D. J. How to find smooth parts of integers http://cr.yp.to/papers.html
   Google Scholar
• Berstein , D. J. 1995 . Enumerating and Counting Smooth Integers , University of California . Ph.D. Thesis
   Google Scholar
• LaMacchia , B. A. and Odlyzko , A. M. 1991 . Solving large sparse linear systems over finite fields . LNCS , 537 : 109 – 133 .
   Google Scholar
• Studholme , C. June 21 2002 . “ Discrete logarithm problem ” . In Research paper requirement (milestone) of the PhD program , June 21 , University of Toronto .
   Google Scholar
• LaMacchia , B. A. and Odlyzko , A. M. 1997 . Computation of discrete logarithms in prime fields . LNCS , 537 : 616
   Google Scholar
• Buchmann , J. and Weber , D. Discrete logarithms: recent progress , Technical Report No: T1-12/98
   Google Scholar
• Odlyzko , A. M. 2000 . Discrete logarithms: the past and the future . Designs Codes and Cryptography , 19 : 129 – 145 .
   Web of Science ®Google Scholar
• Lambert , R. 1996 . Computational aspects of discrete logarithms Ph.D. Thesis
   Google Scholar
• McCurely . The discrete logarithm problem, cryptology and computational number theory , Proceeding of Symposia in Applied Mathematics Vol. 42 , 49 – 74 . of
   Google Scholar
• 2005 . Handbook of Elliptic and Hyperelliptic Curve Cryptography , CRC Press .
   Google Scholar