Beer-recovery attack Jean-Philippe Aumasson Dmitry Khovratovich K - - PowerPoint PPT Presentation

beer recovery attack
SMART_READER_LITE
LIVE PREVIEW

Beer-recovery attack Jean-Philippe Aumasson Dmitry Khovratovich K - - PowerPoint PPT Presentation

Beer-recovery attack Jean-Philippe Aumasson Dmitry Khovratovich K ECCAK SHA-3 candidate K ECCAK SHA-3 candidate Sponge with permutation K ECCAK - f [1600] K ECCAK SHA-3 candidate Sponge with permutation K ECCAK - f [1600] No external


slide-1
SLIDE 1

Beer-recovery attack

Jean-Philippe Aumasson Dmitry Khovratovich

slide-2
SLIDE 2

KECCAK

SHA-3 candidate

slide-3
SLIDE 3

KECCAK

SHA-3 candidate Sponge with permutation KECCAK-f[1600]

slide-4
SLIDE 4

KECCAK

SHA-3 candidate Sponge with permutation KECCAK-f[1600] No external cryptanalysis

slide-5
SLIDE 5

KECCAK

SHA-3 candidate Sponge with permutation KECCAK-f[1600] No external cryptanalysis A Trappist 25-beer award

slide-6
SLIDE 6

KECCAK

SHA-3 candidate Sponge with permutation KECCAK-f[1600] No external cryptanalysis A Trappist 25-beer award So we start...

slide-7
SLIDE 7

CICO problem for KECCAK-f[1600]

KECCAK-f[1600]: {0, 1}1600 → {0, 1}1600 18 rounds Constrained Input – Constrained Output (CICO) problem:

◮ Fix X, Y ⊂ {0, 1}1600 ◮ Find many x ∈ X, y ∈ Y:

f(x) = y

◮ Hard if X and Y are small

H Input Output

· · ·

0 0

· · ·

slide-8
SLIDE 8

Triangulation tool

◮ View the transformation as a system of

equations

◮ Fix some input and output bits to 0 ◮ Find solutions with complexity 1

slide-9
SLIDE 9

Three rounds (of 18) can be attacked The tool is online: https://cryptolux.uni.lu/ mediawiki/uploads/0/03/Keccak-tool.zip

slide-10
SLIDE 10

Algebraic analysis

Bounds b on the degree given in the spec (⇒ cube tester in 2b+1 possible) Our result: heterogeneous algebraic structure even for small cubes

slide-11
SLIDE 11

3 rounds, degree-2 cubes

#components attacked = cube position

slide-12
SLIDE 12

4 rounds, degree-9 cubes

#components attacked = cube position

slide-13
SLIDE 13

KECCAK’s doc conjectures 13 rounds enough against distinguishers Need 11 rounds for maximal degree. . . Open problem: how many rounds for a homogenous (reduced-degree) structure?

slide-14
SLIDE 14

Truncated differentials

First find ∆in → ∆out for θ−1 with Hamming weight |∆in| = 1, |∆out| ≈ 1600/2 (conjectured optimal in the documentation) Used to find probability-1 truncated differential

  • n 3 rounds
slide-15
SLIDE 15

On four rounds, still large biases

slide-16
SLIDE 16

Conclusions

Inverse permutation more difficult to attack

◮ Faster diffusion ◮ Prob-1 differentials on 1 round only

Results consistent with the designers’ analysis Good security margin The paper is online http://131002.net/data/papers/AK09.pdf