Skip to main content

Mehr über Blockchiffren

  • Chapter
  • First Online:
Kryptografie verständlich

Part of the book series: eXamen.press ((EXAMEN))

  • 22k Accesses

Zusammenfassung

In diesem Kapitel erlernen Sie

  • die wichtigsten praxisrelevanten Betriebsmodi für Blockchiffren,

  • Sicherheitsfallen bei der Verwendung von Betriebsmodi,

  • das Prinzip des Key Whitening,

  • warum die Doppelverschlüsselung mit Blockchiffren kaum einen Sicherheitsgewinn darstellt sowie den Meet-in-the-Middle-Angriff,

  • das Prinzip der Dreifachverschlüsselung.

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

Access this chapter

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

Literatur

  1. ANSI X9.31-1998, American National Standard X9.31, Appendix A.2.4: Public Key Cryptography Using Reversible Algorithms for the Financial Services Industry (rDSA). Technical report, Accredited Standards Committee X9 (2001), http://www.x9.org. Zugegriffen am 1. April 2016

  2. C.H. Bennett, E. Bernstein, G. Brassard, U. Vazirani, The strengths and weaknesses of quantum computation. SIAM Journal on Computing 26, 1510–1523 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. L. Grover, A fast quantum-mechanical algorithm for database search, in Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing (ACM, 1996), S. 212–219

    Google Scholar 

  4. M. Hellman, A cryptanalytic time-memory tradeoff. IEEE Transactions on Information Theory 26(4), 401–406 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  5. Block Cipher Modes Workshops, http://csrc.nist.gov/groups/ST/toolkit/BCM/workshops.html. Zugegriffen am 1. April 2016

  6. Philippe Oechslin, Making a faster cryptanalytic time-memory trade-off, in CRYPTO ’03: Proceedings of the 23rd Annual International Cryptology Conference, Advances in Cryptology. LNCS, Bd. 2729 (Springer, 2003), S. 617–630

    Google Scholar 

  7. Dorothy Elizabeth Robling Denning, Cryptography and Data Security (Addison-Wesley Longman Publishing Co., Inc., 1982)

    MATH  Google Scholar 

  8. P. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms. SIAM Journal on Computing, Communication Theory of Secrecy Systems 26, 1484–1509 (1997)

    MathSciNet  MATH  Google Scholar 

  9. NIST Special Publication SP800-38D: Recommendation for Block Cipher Modes of Operation: Galois/Counter Mode (GCM) and GMAC (2007), http://csrc.nist.gov/publications/nistpubs/800-38D/SP-800-38D.pdf. Zugegriffen am 1. April 2016

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jan Pelzl .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Pelzl, J., Paar, C. (2016). Mehr über Blockchiffren. In: Kryptografie verständlich. eXamen.press. Springer Vieweg, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49297-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49297-0_5

  • Published:

  • Publisher Name: Springer Vieweg, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49296-3

  • Online ISBN: 978-3-662-49297-0

  • eBook Packages: Computer Science and Engineering (German Language)

Publish with us

Policies and ethics