Skip to main content
SpringerLink
Log in

An Extremely Small and Efficient Identification Scheme

  • Conference paper
Information Security and Privacy (ACISP 2000)

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

Included in the following conference series:

Abstract

We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications.

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. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1975)

    Google Scholar 

  2. Anshel, M., Goldfeld, D.: Zeta functions, one-way functions, and pseudoran- dom number generators. Duke Math. J. 88, 371–390 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bach, E., Shallit, J.: Algorithmic number theory. MIT Press, Cambridge (1996)

    MATH  Google Scholar 

  4. Biham, E., Boneh, D., Reingold, O.: Breaking generalized Diffie-Hellman modulo a composite is not weaker than factoring. Inform. Proc. Letters 70, 83–87 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cohen, H.: A course in Computational Algebraic Number Theory. Springer, Berlin (1997)

    Google Scholar 

  6. von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  7. Goldfeld, D., Hoffstein, J.: On the number of Fourier coefficients that determine a modular form. Contemp. Math. 143, 385–393 (1993)

    MathSciNet  Google Scholar 

  8. Hoffstein, J., Lieman, D., Silverman, J.: Polynomial rings and efficient public key authentication. In: Blum, M., Lee, C.H. (eds.) Proc. the Intern. Workshop on Cryptographic Techniques and E-Commerce (CrypTEC 1999). City University of Hong Kong Press (1999) (to appear)

    Google Scholar 

  9. McCurley, K.S.: A key distribution system equivalent to factoring. J. Cryptology 1, 95–105 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  10. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Missouri, Columbia, MO, 65211, USA

    William D. Banks & Daniel Lieman

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

    Igor E. Shparlinski

Authors
  1. William D. Banks
    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

  3. Igor E. Shparlinski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Security Research Centre, Queensland University of Technology, GPO Box 2434, 4000, Brisbane, Queensland, Australia

    E. P. Dawson , A. Clark  & Colin Boyd ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Banks, W.D., Lieman, D., Shparlinski, I.E. (2000). An Extremely Small and Efficient Identification Scheme. In: Dawson, E.P., Clark, A., Boyd, C. (eds) Information Security and Privacy. ACISP 2000. Lecture Notes in Computer Science, vol 1841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10718964_31

Download citation

  • DOI: https://doi.org/10.1007/10718964_31

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45030-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation