Skip to main content

Solutions

  • Chapter
  • 1599 Accesses

Abstract

Solutions to the exercises from the previous chapter.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   84.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

References

  1. Coppersmith, D.: Finding a small root of a bivariate equation; factoring with high bits known. In: Maurer, U.M. (ed.) EUROCRYPT. LNCS, vol. 1070, pp. 178–189. Springer, Berlin (1996)

    Google Scholar 

  2. Coudert, O., Berthet, C., Madre, J.C.: Verification of synchronous sequential machines based on symbolic execution. In: Automatic Verification Methods for Finite State Systems. LNCS, vol. 407, pp. 365–373. Springer, Berlin (1989)

    Chapter  Google Scholar 

  3. Doyle, A.C.: The Return of Sherlock Holmes, chapter The Adventure of the Dancing Men. Georges Newnes, Ltd (1905). Originally published 1903, Available online http://en.wikisource.org/wiki/The_Adventure_of_the_Dancing_Men

  4. Finny: A RC4 cycle that can’t happen. Posting to sci.crypt, September 1994

  5. Gaines, H.F.: Cryptanalysis. Dover, New York (1956)

    Google Scholar 

  6. Knuth, D.E.: The Art of Computer Programming, vol. 4. Generating All Tuples and Permutations. Addison-Wesley, Upper Saddle River (2005)

    Google Scholar 

  7. Krause, M.: BDD-based attacks of keystream generators. In: Knudson, L. (ed.) Advances in Cryptology—EUROCRYPT ’02. LNCS, vol. 1462, pp. 222–237. Springer, Berlin (2002)

    Google Scholar 

  8. Meier, W., Staffelbach, O.: The self-shrinking generator. In: Proceedings of EUROCRYPT ’94. LNCS, vol. 950, pp. 205–214 (1994)

    Chapter  Google Scholar 

  9. Odlyzko, A.M.: The rise and fall of the knapsack cryptosystem. In: Pomerance, C. (ed.) Cryptology and Computational Number Theory. Proceeding of Symposia in Applied Mathematics, vol. 42, pp. 75–88. American Mathematical Society, Providence (1990)

    Chapter  Google Scholar 

  10. Poe, E.A.: A Few Words on Secret Writing. Graham’s Magazine. July 1841

    Google Scholar 

  11. Poe, E.A.: The Gold-Bug. The Dollar Newspaper (Philadelphia, PA), vol. I, no. 23, pp. 1 and 4, June 28 1843. Available online http://www.eapoe.org/works/tales/goldbga2.htm

  12. Shamir, A., Zippel, R.E.: On the security of the Merkel-Hellman cryptographic scheme. IEEE Trans. Inf. Theory IT-26(3), 339–340 (1980)

    Article  Google Scholar 

  13. Warren, H.S. Jr: Homepage of Hacker’s Delight. http://www.hackersdelight.org/. Contains example programs, errata and additional material

  14. Wegner, P.: A technique for counting ones in a binary computer. Commun. ACM 3, 322 (1960)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this chapter

Cite this chapter

Klein, A. (2013). Solutions. In: Stream Ciphers. Springer, London. https://doi.org/10.1007/978-1-4471-5079-4_18

Download citation

Publish with us

Policies and ethics