Abstract
In this chapter we summarize the complexities of the major attacks described in this book. In the data collection phase, many pairs are encrypted under the unknown key on the target machine. The resultant ciphertexts are then fed into a data analysis algorithm, whose goal is to find the key. The complexities are quoted in terms of the number of encryptions needed to create all the necessary pairs in the data collection phase, since the data analysis algorithm is usually faster and uses fewer and simpler operations. These complexities are calculated for the electronic code book (ECB) mode of operation; however, the quoted known plaintext complexities hold even when the cipher block chaining (CBC) mode, the cipher feedback (CFB) mode, or the output feedback (OFB) mode are used.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Biham, E., Shamir, A. (1993). Results. In: Differential Cryptanalysis of the Data Encryption Standard. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9314-6_2
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9314-6_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9316-0
Online ISBN: 978-1-4613-9314-6
eBook Packages: Springer Book Archive