Author:
Barbulescu Razvan,Gaudry Pierrick,Kleinjung Thorsten
Publisher
Springer Berlin Heidelberg
Reference36 articles.
1. Adleman, L.M., Lenstra, H.W.: Finding irreducible polynomials over finite fields. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 350–355. ACM (1986)
2. Lecture Notes in Computer Science;K Aoki,2007
3. Bai, S.: Polynomial selection for the number field sieve. Ph.D. thesis, Australian National University (2011)
4. Bai, S., Bouvier, C., Kruppa, A., Zimmermann, P.: Better polynomials for GNFS. Preprint (2014)
5. Barbulescu, R.: Algorithmes de logarithmes discrets dans les corps finis. Ph.D. thesis, Université de Lorraine (2013)
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献