Skip to main content
Springer Nature Link
Log in

Some computational aspects of root finding in GF(qm)

  • Algorithmic Number Theory
  • Conference paper
  • First Online:
Symbolic and Algebraic Computation (ISSAC 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 358))

Included in the following conference series:

Abstract

This paper is an implementation report comparing several variations of a deterministic algorithm for finding roots of polynomials in finite extension fields. Running times for problem instances in fields GF(2m), including m>1000, are given. Comparisons are made between the variations, and improvements achieved in running times are discussed.

This work was supported by NSERC Grant No. A9258

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. E.R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York, 1968.

    Google Scholar 

  2. E.R. Berlekamp, “Factoring polynomials over large finite fields”, Math. Comp. 24 (1970), 713–735.

    Google Scholar 

  3. D.G. Cantor and H. Zassenhaus, “A new algorithm for factoring polynomials over finite fields”, Math. Comp. 36 (1981), 587–592.

    Google Scholar 

  4. R. Lidl and H. Niederreiter, Finite Fields, Addison-Wesley, 1983.

    Google Scholar 

  5. R.C. Mullin, I.M. Onyszchuk, S.A. Vanstone and R.M. Wilson, “Optimal normal bases in GF(p n)”, Discrete Applied Math. (to appear).

    Google Scholar 

  6. M.O. Rabin, “Probabilistic algorithms in finite fields”, SIAM J.Comput. 9 (1980), 273–280.

    Google Scholar 

  7. P.C. van Oorschot and S.A. Vanstone, “A geometric approach to root finding in GF(q m)”, IEEE Transactions on Information Theory (to appear).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    A. J. Menezes & S. A. Vanstone

  2. Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    P. C. van Oorschot & S. A. Vanstone

Authors
  1. A. J. Menezes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. C. van Oorschot
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. A. Vanstone
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Gianni

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Menezes, A.J., van Oorschot, P.C., Vanstone, S.A. (1989). Some computational aspects of root finding in GF(qm). In: Gianni, P. (eds) Symbolic and Algebraic Computation. ISSAC 1988. Lecture Notes in Computer Science, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51084-2_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-51084-2_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51084-0

  • Online ISBN: 978-3-540-46153-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics