Skip to main content
SpringerLink
Log in

On the Generalised Hidden Number Problem and Bit Security of XTR

  • 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

We consider a certain generalisation of the hidden number problem which has recently been introduced by Boneh and Venkatesan. We apply our results to study the bit security of the XTR cryptosystem and obtain some analogues of the results which have been known for the bit security of the Difie-Hellman scheme.

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. D. Boneh and R. Venkatesan, Hardness of computing the most significant bits of secret keys in Difie-Hellman and related schemes, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1109 (1996), 129–142.

    Google Scholar 

  2. D. Boneh and R. Venkatesan, Rounding in lattices and its cryptographic applications, Proc. 8th AnnualA CM-SIAM Symp. on Discr. Algorithms, ACM, NY, 1997, 675–681.

    Google Scholar 

  3. A. E. Brouwer, R. Pellikaan and E. R. Verheul, Doing more with fewer bits, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1716(1999), 321–332.

    Google Scholar 

  4. R. Canetti, J. B. Friedlander, S. Konyagin, M. Larsen, D. Lieman and I. E. Shparlinski, On the statistical properties of Difie-Hellman distributions, IsraelJ. Math., 120 (2000), 23–46.

    MATH  MathSciNet  Google Scholar 

  5. E. ElMahassni, P. Q. Nguyen and I. E. Shparlinski, The insecurity of Nyberg-Rueppel and other DSA-like signature schemes with partially known nonces, Proc. Workshop on Lattices and Cryptography, Boston, MA, 2001 (to appear).

    Google Scholar 

  6. J. B. Friedlander, M. Larsen, D. Lieman and I. E. Shparlinski, On correlation of binary M-sequences, Designs, Codes and Cryptography, 16(1999), 249–256.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. I. González Vasco and I. E. Shparlinski, On the security of Difie-Hellman bits, Proc. Workshop on Cryptography and ComputationalNum ber Theory, Singapore 1999, Birkhäuser, 2001, 257–268.

    Google Scholar 

  8. M. I. González Vasco and I. E. Shparlinski, Security of the most significant bits of the Shamir message passing scheme, Math. Comp. (to appear).

    Google Scholar 

  9. N. A. Howgrave-Graham and N. P. Smart, Lattice attacks on digital signature schemes, Designs, Codes and Cryptography, (to appear).

    Google Scholar 

  10. R. Kannan, Algorithmic geometry of numbers, AnnualReview of Comp. Sci., 2 (1987), 231–267.

    Article  MathSciNet  Google Scholar 

  11. R. Kannan, Minkowski’s convex body theorem and integer programming, Math. of Oper. Research, 12 (1987), 231–267.

    Google Scholar 

  12. S. V. Konyagin and I. Shparlinski, Character sums with exponential functions and their applications, Cambridge Univ. Press, Cambridge, 1999.

    MATH  Google Scholar 

  13. A. K. Lenstra, H. W. Lenstra and L. Lovász, Factoring polynomials with rational coeficients, Mathematische Annalen, 261 (1982), 515–534.

    Article  MATH  MathSciNet  Google Scholar 

  14. A. K. Lenstra and E. R. Verheul, The XTR public key system, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1880 (2000), 1–19.

    Google Scholar 

  15. A. K. Lenstra and E. R. Verheul, Key improvements to XTR, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1976 (2000), 220–233.

    Google Scholar 

  16. R. Lidland H. Niederreiter, Finite fields, Cambridge University Press, Cambridge, 1997.

    Google Scholar 

  17. D. Micciancio, On the hardness of the shortest vector problem, PhD Thesis, MIT,1998.

    Google Scholar 

  18. P. Q. Nguyen, The dark side of the Hidden Number Problem: Lattice attacks on DSA, Proc. Workshop on Cryptography and ComputationalNum ber Theory, Singapore 1999, Birkhäuser, 2001, 321–330.

    Google Scholar 

  19. P. Q. Nguyen and I. E. Shparlinski, The insecurity of the Digital Signature Algorithm with partially known nonces, Preprint, 2000, 1–26.

    Google Scholar 

  20. P. Q. Nguyen and I. E. Shparlinski, The insecurity of the elliptic curve Digital Signature Algorithm with partially known nonces, Preprint, 2001, 1–16.

    Google Scholar 

  21. P. Q. Nguyen and J. Stern, Lattice reduction in cryptology: An update, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1838(2000), 85–112.

    Google Scholar 

  22. P. Q. Nguyen and J. Stern, ‘The two faces of lattices in cryptology’, Proc. Workshop on Lattices and Cryptography, Boston, MA, 2001, Springer-Verlag, Berlin,(to appear).

    Book  Google Scholar 

  23. C. P. Schnorr, A hierarchy of polynomial time basis reduction algorithms, Theor. Comp. Sci., 53 (1987), 201–224.

    Article  MATH  MathSciNet  Google Scholar 

  24. I. E. Shparlinski, Security of polynomial transformations of the Difie-Hellman key, Preprint, 2000, 1–8.

    Google Scholar 

  25. I. E. Shparlinski, Sparse polynomial approximation in finite fields, Proc. 33rd ACM Symp. on Theory of Comput., Crete, Greece, July 6–8, 2001, 209–215.

    Google Scholar 

  26. E. R. Verheul, Certificates of recoverability with scalable recovery agent security, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1751(2000), 258–275.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Igor E. Shparlinski

Authors
  1. Igor E. Shparlinski
    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

Shparlinski, I.E. (2001). On the Generalised Hidden Number Problem and Bit Security of XTR. 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_28

Download citation

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

  • 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