Skip to main content
SpringerLink
Log in

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

  • Letter
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Diffie W, Hellman M. New directions in cryptography. IEEE Trans Inform Theory, 1976, 22: 644–654

    Article  MathSciNet  MATH  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

  3. Koblitz N. Elliptic curve cryptosystems. Math Comput, 1987, 48: 203–209

    Article  MathSciNet  MATH  Google Scholar 

  4. Wang L L, Chen K F, Long Y, et al. An efficient pairing-free certificateless signature scheme for resource-limited systems. Sci China Inf Sci, 2017, 60: 119102

    Article  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

  6. Joux A, Pierrot C. Improving the polynomial time pre-computation 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

  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

    Article  MathSciNet  MATH  Google Scholar 

  8. Xiao D Y, Zhuang J C, Cheng Q. Factor base discrete logarithms in Kummer extensions. Finite Fields Theiry Appl, 2018, 53: 205–225

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

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).

Author information

Authors and Affiliations

  1. Institute for Advanced Study, Tsinghua University, Beijing, 100084, China

    Dianyan Xiao

  2. School of Computer Science, University of Oklahoma, Norman, OK, 73019, USA

    Qi Cheng

Authors
  1. Dianyan Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qi Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dianyan Xiao.

Supporting information

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xiao, D., Cheng, Q. A faster method to compute primitive elements and discrete logarithms of factor base in Artin-Schreier extensions. Sci. China Inf. Sci. 62, 199501 (2019). https://doi.org/10.1007/s11432-017-9700-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-017-9700-7

Search

Navigation