Abstract
The cardinal number of a class of methods—corresponding to the number of available keys—is a criterion for the combinatorial complexity of the encryption. As a measure of security against unauthorized decryption, it gives an upper bound on the work required for an exhaustive search under the assumption that the class of methods is known (Shannon’s maxim: “The enemy knows the system being used.”)
Gewöhnlich glaubt der Mensch, wenn er nur Worte hört, es müsse sich dabei doch auch was denken lassen.
Goethe
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
26! = 403 291 461126605 635 584000000 = 223 • 310 • 56 • 73 -ll2 • 132 • 17 • 19 • 23
ldx denotes the logarithm with the base 2: ldx = ln x/ln 2 = 10log x/ 10log 2.
‘A crypto device can fall into the hands of the enemy’: Maxim No. 3 (Sect. 11.2.3). Bazeries invented his device in 1891, eight years after Kerckhoffs had published his advice.
The rule has the following background in information theory:
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bauer, F.L. (2000). Exhausting Combinatorial Complexity. In: Decrypted Secrets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04024-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-662-04024-9_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-04026-3
Online ISBN: 978-3-662-04024-9
eBook Packages: Springer Book Archive