Skip to main content
SpringerLink
Log in
Book cover

Cryptography and Computational Number Theory pp 59–68Cite as

Birkhäuser

The Distribution of the Quadratic Symbol in Function Fields and a Faster Mathematical Stream Cipher

  • Conference paper

Part of the book series: Progress in Computer Science and Applied Logic ((PCS,volume 20))

Abstract

We present a stream cipher based on mathematical considerations which is much faster then many other mathematical ciphers. Its security is based on the uniformity of the distribution of the quadratic symbol in function fields.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Anshel and D. Goldfeld, Zeta functions, one-way functions, and pseudorandom number generators, Duke Mathematical Journal 88 (1997), 371–390.

    Article  MathSciNet  MATH  Google Scholar 

  2. M. Anshel and D. Goldfeld, Multi-purpose high speed cryptographically secure sequence generator based on zeta-one-way functions, U.S. Patent 5,577,124 (1996).

    Google Scholar 

  3. E. Bombieri and J.B. Friedlander Dirichlet polynomial approximations to zeta functions, Ann. Scuola norm. Sup. Pisa. Cl. Sci. 22 (1995), 517–544.

    MathSciNet  MATH  Google Scholar 

  4. D. Boneh and R. Lipton, Algorithms for black-box fields and their applications to cryptography, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1109 (1996), 283–297.

    Article  Google Scholar 

  5. H. Cohen, A Course in Computational Number Theory, Grad. Texts in Math., Graduate Texts in Mathematics, 138 (1993), Springer-Verlag, New York.

    Google Scholar 

  6. T. W. Cusic, C. Ding and A. Renvall, Stream ciphers and number theory, Elsevier, Amsterdam, 1998.

    Google Scholar 

  7. F. Diamond, On deformation rings and Hecke rings,Annals of Math., 144 (1996), 137–166.

    Article  MathSciNet  MATH  Google Scholar 

  8. I. B. Damgård, On the randomness of Legendre and Jacobi sequences, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 403 (1990), 163–172.

    Article  Google Scholar 

  9. D. Goldfeld and J. Hoffstein, On the number of Fourier coefficients that determine a modular form, A Tribute to Emil Grosswald: Number Theory and Related Analysis, Comtemp. Math 143 (1993) 385–393.

    Article  MathSciNet  Google Scholar 

  10. C. Mauduit and A. Sárközy, On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol, Acta Arithm., 82 (1997), 365–377.

    MATH  Google Scholar 

  11. M. Naor and O. Reingold, Number-theoretic constructions of efficient pseudorandom functions, Proc. 38th IEEE Symp. on Foundations of Comp. Sci. (FOCS’97), Miami Beach, IEEE (1997), 458–467.

    Google Scholar 

  12. R. Peralta, On the distribution of quadratic residues and nonresidues modulo a prime number, Math. Comp., 58 (1992), 433–440.

    Article  MathSciNet  MATH  Google Scholar 

  13. R. Taylor and A. Wiles, Ring-theoretic properties of certain Hecke algebras, Annals of Math. 141 (1995), 553–572.

    Article  MathSciNet  MATH  Google Scholar 

  14. A. Weil, On the Riemann hypothesis in function fields, Proc. Nat. Acad. Sci. U.S.A. 27 (1941), 45–347.

    Article  MathSciNet  Google Scholar 

  15. A. Wiles, Modular elliptic curves and Fermat’s last theorem, Annals of Math. 141 (1995), 443–551.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Brown University, Box 1917, Providence, RI, 02912, USA

    Jeffrey Hoffstein

  2. Department of Mathematics, University of Georgia, Athens, GA, 30602, USA

    Daniel Lieman

Authors
  1. Jeffrey Hoffstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Lieman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, National University of Singapore, 2 Science Drive 2, 117543, Singapore

    Kwok-Yan Lam

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

    Igor Shparlinski

  3. Department of Computer Science, University of Wollongong, NSW, 2522, Australia

    Huaxiong Wang

  4. Department of Mathematics, National University of Singapore, 2 Science Drive 2, 117543, Singapore

    Chaoping Xing

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Basel AG

About this paper

Cite this paper

Hoffstein, J., Lieman, D. (2001). The Distribution of the Quadratic Symbol in Function Fields and a Faster Mathematical Stream Cipher. In: Lam, KY., Shparlinski, I., Wang, H., Xing, C. (eds) Cryptography and Computational Number Theory. Progress in Computer Science and Applied Logic, vol 20. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8295-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8295-8_7

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9507-1

  • Online ISBN: 978-3-0348-8295-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation