Paper 2015/1009
Applications of Key Recovery Cube-attack-like
Pawel Morawiecki, Josef Pieprzyk, Michal Straus, and Marian Srebrny
Abstract
In this paper, we describe a variant of the cube attack with much better-understood Preprocessing Phase, where complexity can be calculated without running the actual experiments and random-like search for the cubes. We apply our method to a few different cryptographic algorithms, showing that the method can be used against a wide range of cryptographic primitives, including hash functions and authenticated encryption schemes. We also show that our key-recovery approach could be a framework for side-channel attacks, where the attacker has to deal with random errors in measurements.
Metadata
- Available format(s)
- Category
- Secret-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- CryptanalysisCube AttacksHash FunctionsAuthenticated EncryptionSide-channel Attacks
- Contact author(s)
- pawel morawiecki @ gmail com
- History
- 2015-10-19: received
- Short URL
- https://ia.cr/2015/1009
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/1009, author = {Pawel Morawiecki and Josef Pieprzyk and Michal Straus and Marian Srebrny}, title = {Applications of Key Recovery Cube-attack-like}, howpublished = {Cryptology {ePrint} Archive, Paper 2015/1009}, year = {2015}, url = {https://eprint.iacr.org/2015/1009} }