Skip to main content
SpringerLink
Log in

Some Comments on the Computation of n-th Roots in Z N

  • Conference paper
Sequences II

  • 234 Accesses

Abstract

Algorithms for the computation of n-th roots in the ring Z N of integers modulo N are discussed with particular reference to computations in prime fields.

This work was financially supported in part by Politecnico di Torino under the internal grant n. POLI4169-87-Cap11205.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.F. Gauss, Disquisitiones Arithmeticae, Springer-Verlag, New York, 1986.

    MATH  Google Scholar 

  2. L. Adleman, K. Manders and G. Miller, On taking roots in Finite Fields, Proc. of the 20th Annual Symp. on the Foundation of Computer Science, 1979, pp. 175–178.

    Google Scholar 

  3. D.M. Bressoud, Factorization and Primality Testing, Springer-Verlag, New York, 1989.

    Book  MATH  Google Scholar 

  4. E. Dehn, Algebraic Equations, Dover, New York, 1960.

    MATH  Google Scholar 

  5. M. Elia, Formulas for the Roots of Algebraic Equations over Finite Fields and the Lagrange-Galois’ Plan, Internal Report, Politecnico di Torino, 1990.

    Google Scholar 

  6. J.W.P. Hirschfeld, Projective Geometries over Finite Fields, Clarendon Press, Oxford, 1979.

    MATH  Google Scholar 

  7. E. Kranakis, Primality and Cryptography, Wiley & Sons, New York, 1986.

    MATH  Google Scholar 

  8. G.B. Mathews, Theory of Numbers, Chelsea, New York, 1990.

    Google Scholar 

  9. R.C. Peralta, A Simple and Fast Probabilistic Algorithm for Computing Square Roots Modulo a Prime Number, IEEE Transactions on Information Theory, vol. IT-32, N.6, November 1986, pp. 846–847.

    Article  MathSciNet  Google Scholar 

  10. S.C. Pohling and M.E. Hellman, An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance, IEEE Transactions on Information Theory, vol. IT-24, N.1, January 1978, pp. 106–110.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Elettronica, Politecnico di Torino, Italy

    Michele Elia

Authors
  1. Michele Elia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of Rome “La Sapienza”, Rome, Italy

    Renato Capocelli

  2. Dipartimento di Informatica ed Applicazioni, Universitá di Salerno, 84081, Baronissi (SA), Italy

    Alfredo De Santis  & Ugo Vaccaro  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag New York, Inc.

About this paper

Cite this paper

Elia, M. (1993). Some Comments on the Computation of n-th Roots in Z N . In: Capocelli, R., De Santis, A., Vaccaro, U. (eds) Sequences II. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9323-8_29

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-9323-8_29

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4613-9325-2

  • Online ISBN: 978-1-4613-9323-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation