Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Maximal Periods of x2 + c in Fq

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2001)

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

Abstract

The orbits produced by the iterations of the mapping x↦ X2 + c, defined over Fq, are studied. Several upper bounds for their pe- riods are obtained, depending on the coefficient c and the number of elements q.

This work is supported by CICYT (Spain)under grant TEL98-1020, Infraestructuras de Seguridad en Internete Intranets. Aplicación a Redes Públicas y Corporativas.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Bach, E., Shallit, J., “Algorithmic Number Theory. Vol I. Efficient algorithms1”, The MIT Press, 1996.

    Google Scholar 

  2. Blum, L., Blum, M., Shub, M., “A simple unpredictable pseudorandom number generator”, SIAM Journal on Computing, 15 (1986), pp. 364–383.

    Article  MATH  MathSciNet  Google Scholar 

  3. Griffin, F., Shparlinski, I., “On the linear complexity profile of the power generator”, IEEE Trans. Inform. Theory, 46 (2000), pp. 2159–2162.

    Article  MATH  MathSciNet  Google Scholar 

  4. Hernández Encinas, L., Montoya Vitini, F., Muñoz Masqué, J., “Generación de sucesiones pseudoaleatorias mediante funciones cuadráticas en ℤpn, y en su límite proyectivo”, Actas de la III Reunión Española de Criptografía, 27–32, (1994).

    Google Scholar 

  5. Hernández Encinas, L., Montoya Vitini, F., Muñoz Masqué, J., Peinado Domínguez, A., “Maximal periods of orbits of the BBS generator”, Proc. 1998 International Conference on Information Security & Cryptology (ICISC’ 98), Seoul, Korea, pp. 71–80, (1998).

    Google Scholar 

  6. Lang, S.,“Algebra”, Addison-Wesley Publishing Company, 3rd ed., 1993.

    Google Scholar 

  7. Lidl, R., Niederreiter, N., “Finite Fields”, Addison-Wesley Publishing Company, 1983.

    Google Scholar 

  8. Mceliece, R.,“Finite Fields for computer scientist and engineers”. Kluwer Academic Publishers, 1987.

    Google Scholar 

  9. Montoya, F., Muñoz, J., Peinado, A., “Linear complexity of the x2 (mod p )orbits”, Information Processing Letters, 72 (1999), pp. 3–7.

    Article  MathSciNet  Google Scholar 

  10. Narkiewicz, W., “Polynomial mappings”, Lecture Notes in Math., 1600. Springer, 1995.

    Google Scholar 

  11. Nyang, D., Song, J., “Fast digital signature scheme based on the quadratic residue problem”, Electronics Letters, 33 (1997), pp. 205–206.

    Article  Google Scholar 

  12. Pollard, J.M., “A Monte Carlo method for factorization”, BIT, 15 (1975), pp. 331–334.

    Article  MATH  MathSciNet  Google Scholar 

  13. Rabin, M.O., “Digitalized signatures and public key functions as intractable as factorization”,Technical report,MIT/LCS/TR212, MIT Lab., Comp.Science, Cambridge, Mass, January 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpto. Ingeniería de Comunicaciones, E.T.S. Ingeniería de Comunicaciones Universidad de Málaga, Campus de Teatinos, 29071, Málaga, Spain

    A. Peinado

  2. Dpto. de Tratamiento de la Información y Codificación, Instituto de Física Aplicada (CSIC), C/Serrano, 144, 28006, Madrid, Spain

    F. Montoya & J. Muñoz

  3. Dpto. Electrónica, Universidad de Jaen, C/Alfonso X, 28, 23700, Linares, Jaen, Spain

    A.J. Yuste

Authors
  1. A. Peinado
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Montoya
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. Muñoz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. A.J. Yuste
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, RMIT University, GPO Box 2476V, 3001, Melbourne, Australia

    Serdar Boztaş

  2. Department of Computing, Macquarie University, 2109, NSW, Australia

    Igor E. Shparlinski

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peinado, A., Montoya, F., Muñoz, J., Yuste, A. (2001). Maximal Periods of x2 + c in Fq . In: Boztaş, S., Shparlinski, I.E. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2001. Lecture Notes in Computer Science, vol 2227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45624-4_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-45624-4_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42911-1

  • Online ISBN: 978-3-540-45624-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation