1. Lecture Notes in Computer Science;DF Aranha,2013
2. J. Balakrishnan, J. Belding, S. Chisholm, K. Eisenträger, K.E. Stange, E. Teske, Pairings on hyperelliptic curves, in CoRR, http://arxiv.org/abs/0908.3731v2 (2009)
3. Lecture Notes in Computer Science;R Barbulescu,2015
4. R. Barbulescu, P. Gaudry, A. Guillevic, F. Morain, Improving NFS for the discrete logarithm problem in non-prime finite fields, in Advances in Cryptology - EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26–30, 2015, Proceedings, Part I, ed. by E. Oswald, M. Fischlin (Springer, Berlin, 2015), pp. 129–155
5. Lecture Notes in Computer Science;R Barbulescu,2014