Abstract
In addition to its usual complexity postulates, cryptography silently assumes that secrets can be physically protected in tamper-proof locations.
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
Notes
- 1.
For example, the algorithm might start mixing the ciphertext’s fifth byte with the key’s third byte.
- 2.
Generalizing the attack to spatial signals such as electromagnetic radiations is straightforward.
- 3.
For example, operations that do not manipulate the key nor the ciphertext.
References
P. Kocher, J. Jaffe, B. Jun, in Differential Power Analysis, Advances in Cryptology - CRYPTO’99, Santa Barbara, CA, USA. Lecture Notes in Computer Science, vol. 1666 (Springer Verlag, Berlin, Heidelberg, 1999), pp. 388–397
R. Langley, Practical Statistics (Dover Publications, New York, NY, 1968)
I. Miller, J. Freund, R. Johnson, Probability and Statistics for Engineers (Prentice Hall, Englewood Cliffs, NJ, 1990)
F. Wilcoxon, Individual comparisons by ranking methods. Biometrics 1, 80–83 (1945)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Baek, YJ., Gratzer, V., Kim, SH., Naccache, D. (2010). Extracting Unknown Keys from Unknown Algorithms Encrypting Unknown Fixed Messages and Returning No Results. In: Sadeghi, AR., Naccache, D. (eds) Towards Hardware-Intrinsic Security. Information Security and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14452-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-14452-3_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14451-6
Online ISBN: 978-3-642-14452-3
eBook Packages: Computer ScienceComputer Science (R0)