Factorization of polynominals over finite fields in subexponential time under GRH

Sergei Evdokimov. Factorization of polynominals over finite fields in subexponential time under GRH. In Leonard M. Adleman, Ming-Deh A. Huang, editors, Algorithmic Number Theory, First International Symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994, Proceedings. Volume 877 of Lecture Notes in Computer Science, pages 209-219, Springer, 1994.

@inproceedings{Evdokimov94,
  title = {Factorization of polynominals over finite fields in subexponential time under GRH},
  author = {Sergei Evdokimov},
  year = {1994},
  researchr = {https://researchr.org/publication/Evdokimov94},
  cites = {0},
  citedby = {0},
  pages = {209-219},
  booktitle = {Algorithmic Number Theory, First International Symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994, Proceedings},
  editor = {Leonard M. Adleman and Ming-Deh A. Huang},
  volume = {877},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-58691-1},
}