The index calculus method using non-smooth polynomials

@article{Garefalakis2001TheIC,
  title={The index calculus method using non-smooth polynomials},
  author={Theodoulos Garefalakis and Daniel Panario},
  journal={Math. Comput.},
  year={2001},
  volume={70},
  pages={1253-1264}
}
We study a generalized version of the index calculus method for the discrete logarithm problem in Fq , when q = pn, p is a small prime and n→∞. The database consists of the logarithms of all irreducible polynomials of degree between given bounds; the original version of the algorithm uses lower bound equal to one. We show theoretically that the algorithm… CONTINUE READING