Name
Abstract | ||
|---|---|---|
Using whitening keys is a well understood mean of increasing the key-length of any given cipher. Especially as it is known ever since Grover’s seminal work that the effective key-length is reduced by a factor of two when considering quantum adversaries, it seems tempting to use this simple and elegant way of extending the key-length of a given cipher to increase the resistance against quantum adversaries. However, as we show in this work, using whitening keys does not increase the security in the quantum-CPA setting significantly. For this we present a quantum algorithm that breaks the construction with whitening keys in essentially the same time complexity as Grover’s original algorithm breaks the underlying block cipher. Technically this result is based on the combination of the quantum algorithms of Grover and Simon for the first time in the cryptographic setting. |
Year | Venue | DocType |
|---|---|---|
2017 | IACR Cryptology ePrint Archive | Conference |
Volume | Citations | PageRank |
2017 | 5 | 0.42 |
References | Authors | |
16 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gregor Leander | 1 | 1287 | 77.03 |
| Alexander May | 2 | 89 | 5.98 |