Skip to main content

Brute Force Attacks

  • Chapter
  • First Online:
The Block Cipher Companion

Part of the book series: Information Security and Cryptography ((ISC))

Abstract

The one attack that can always be mounted against any block cipher is a search for the key. No amount of clever design can prevent this attack and the designers’ aim is to ensure that this is the best attack available to the adversary.

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 64.99
Price excludes VAT (USA)
  • Available as 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
Hardcover Book
USD 84.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lars R. Knudsen .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Knudsen, L.R., Robshaw, M.J.B. (2011). Brute Force Attacks. In: The Block Cipher Companion. Information Security and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17342-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17342-4_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17341-7

  • Online ISBN: 978-3-642-17342-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics