| [2] |
G. Adj, A. Menezes, T. Oliveira and F. Rodríguez-Henríquez, Weakness of mathbbF66cdot1429\mathbb{F}_{6^{6\cdot 1429}}mathbbF66cdot1429 and mathbbF24cdot3041\mathbb{F}_{2^{4\cdot 3041}}mathbbF24cdot3041 for discrete logarithm cryptography, Finite Fields and Their Applications, 32 (2015), 148-170. doi: 10.1016/j.ffa.2014.10.009.   |
| [3] |
L. M. Adleman, The function field sieve, in (L. M. Adleman and M.-D. A. Huang, eds.), ANTS, Lecture Notes in Computer Science, 877, Springer, 1994,108–121. doi: 10.1007/3-540-58691-1_48. |
| [4] |
L. M. Adleman and M.-D. A. Huang, Function field sieve method for discrete logarithms over finite fields, Inf. Comput., 151 (1999), 5-16. doi: 10.1006/inco.1998.2761. |
| [5] |
D. Adrian, et al., Imperfect forward secrecy: How Diffie-Hellman fails in practice, Commun. ACM, 62 (2019), 106–114. |
| [6] |
R. Barbulescu, P. Gaudry, A. Joux and E. Thomé, A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic, Lecture Notes in Computer Science, 8441 (2014), 1-16. doi: 10.1007/978-3-642-55220-5_1. |
| [7] |
F. Boudot, P. Gaudry, A. Guillevic, N. Heninger, E. Thomé, and P. Zimmermann, Comparing the difficulty of factorization and discrete logarithm: A240-digit experiment, IACR Cryptol. ePrint Arch., 697 (2020). |
| [8] |
D. Coppersmith, Fast evaluation of logarithms in fields of characteristic two, IEEE Transactions on Information Theory, 30 (1984), 587-594. doi: 10.1109/TIT.1984.1056941. |
| [9] |
J. Detrey, P. Gaudry and M. Videau, Relation collection for the function field sieve, in (A. Nannarelli, P.-M. Seidel, and P. T. P. Tang, eds.) IEEE Symposium on Computer Arithmetic, IEEE Computer Society, 2013,201–210. doi: 10.1109/TC.2014.2331711. |
| [10] |
W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Trans. Information Theory, 22 (1976), 644–654. doi: 10.1109/tit.1976.1055638. |
| [11] |
F. Göloglu, R. Granger, G. McGuire and J. Zumbrägel, On the function field sieve and the impact of higher splitting probabilities - application to discrete logarithms in mathbbF21971\mathbb{F}_{2^1971}mathbbF21971 and mathbbF23164\mathbb{F}_{2^3164}mathbbF23164, Lecture Notes in Computer Science, 8043 (2013), 109-128. doi: 10.1007/978-3-642-40084-1_7. |
| [12] |
F. Göloglu, R. Granger, G. McGuire and J. Zumbrägel, Solving a 612061206120-bit DLP on a desktop computer, Lecture Notes in Computer Science, 8282 (2013), 136-152. doi: 10.1007/978-3-662-43414-7. |
| [13] |
D. M. Gordon, Discrete logarithms in $ {\rm{GF }}(p)$ using the number field sieve, SIAM J. Discrete Math., 6 (1993), 124-138. doi: 10.1137/0406010. |
| [14] |
R. Granger, T. Kleinjung and J. Zumbrägel, Breaking '128-bit secure' supersingular binary curves – (or how to solve discrete logarithms in mathbbF24cdot1223\mathbb{F}_{2^{4\cdot 1223}}mathbbF24cdot1223 and mathbbF212cdot367\mathbb{F}_{2^{12\cdot 367}}mathbbF212cdot367), Lecture Notes in Computer Science, 8617 (2014), 126-145. doi: 10.1007/978-3-662-44381-1_8. |
| [15] |
R. Granger, T. Kleinjung and J. Zumbrägel, Discrete logarithms in GF(29234)GF(2^9234)GF(29234), NMBRTHRY List, (2014). |
| [16] |
R. Granger, T. Kleinjung, and J. Zumbrägel, Discrete logarithms in GF(230750)GF(2^30750)GF(230750)., NMBRTHRY List, (2019). |
| [17] |
A. Joux, Algorithmic Cryptanalysis, Cryptography and Network Security, Chapman & Hall/CRC, 2009. doi: 10.1201/9781420070033. |
| [18] |
A. Joux, Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields, in Annual International Conference on the Theory and Applications of Cryptographic Techniques, Eurocrypt, Springer, 2013,177–193. doi: 10.1007/978-3-642-38348-9_11. |
| [19] |
A. Joux and R. Lercier, The function field sieve is quite special, in (C. Fieker and D. R. Kohel, eds.), ANTS, Lecture Notes in Computer Science, 2369, Springer, 2002,431–445. doi: 10.1007/3-540-45455-1_34. |
| [20] |
A. Joux and R. Lercier, The function field sieve in the medium prime case, in Annual International Conference on the Theory and Applications of Cryptographic Techniques, Eurocrypt, Springer, 2006,254–270. doi: 10.1007/11761679_16. |
| [21] |
T. Lange, Digital signature: DSA with medium fields, Available from: https://www.mysterytwisterc3.org/images/challenges/mtc3-lange-01-dsasig-en.pdf, 2011. |
| [22] |
G. De Micheli, P. Gaudry and C. Pierrot, Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields, IACR Cryptol. ePrint Arch., 329, 2020. |
| [23] |
National Institute of Standards and Technology, Digital Signature Algorithm, https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-4.pdf, 2013. |
| [24] |
P. Sarkar and S. Singh, Fine tuning the function field sieve algorithm for the medium prime case, IEEE Transactions on Information Theory, 62 (2016), 2233-2253. doi: 10.1109/TIT.2016.2528996. |
| [25] |
P. Sarkar and S. Singh, Fine tuning the function field sieve algorithm for the medium prime case, IACR Cryptol. ePrint Arch., 2014: 65 (2020). http://eprint.iacr.org/2014/065. doi: 10.1109/TIT.2016.2528996. |
| [26] |
W. A. Stein, et al., Sage Mathematics Software, The Sage Development Team, (2013). http://www.sagemath.org. |
| [27] |
The CADO-NFS Development Team, CADO-NFS, an implementation of the number field sieve algorithm, Development version, (2019). |