SCIENCE CHINA Information Sciences, Volume 62 , Issue 9 : 199501(2019) https://doi.org/10.1007/s11432-017-9700-7

A faster method to compute primitive elements and discrete logarithms of factor base in Artin-Schreier extensions

More info
  • ReceivedAug 30, 2018
  • AcceptedNov 21, 2018
  • PublishedJul 30, 2019


There is no abstract available for this article.


This work was partially supported by National Key Research and Development Program of China (Grant No. 2017YFA0303903), National Natural Science Foundation of China (Grant No. 61502269), and National Science Foundation of the United States (Grant No. CCF-1409294).


Appendixes A–C.


[1] Diffie W, Hellman M. New directions in cryptography. IEEE Trans Inform Theor, 1976, 22: 644-654 CrossRef Google Scholar

[2] ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. In: Proceedings of Workshop on the Theory and Application of Cryptographic Techniques, 1984. Google Scholar

[3] Koblitz N. Elliptic curve cryptosystems. Math Comp, 1987, 48: 203-209 CrossRef Google Scholar

[4] Wang L, Chen K, Long Y. An efficient pairing-free certificateless signature scheme for resource-limited systems. Sci China Inf Sci, 2017, 60: 119102 CrossRef Google Scholar

[5] Joux A. A new index calculus algorithm with complexity L(1/4+o(1)) in small characteristic. In: Proceedings of International Conference on Selected Areas in Cryptography, 2013. Google Scholar

[6] Joux A, Pierrot C. Improving the polynomial time precomputation of Frobenius representation discrete logarithm algorithms -- simplified setting for small characteristic finite fields. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, 2014. Google Scholar

[7] Pohlig S, Hellman M. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans Inform Theory, 1978, 24: 106--110. Google Scholar

[8] Xiao D, Zhuang J, Cheng Q. Factor base discrete logarithms in Kummer extensions. Finite Fields Their Appl, 2018, 53: 205-225 CrossRef Google Scholar


Contact and support