Lower Upper Boundson inverting functions

mm

Krzysztof Pietrzak

1ST Austriaum

AttacksHellman'sTime spaceTrade off

nm

Rainbow tablespassTordslDES

Lower Bounds

Yao90DeTrevisasTulsauilog

Applications Techniques

Proofs ofSpace Compression

SACKPR 17Argument

7Adversaries

mm

RAMmodel

CircuitTuring

Machines

Circuit of site C RAM in time

8K usingOC site

data structure

RAM timeTang Circuit ofS sizespace

0C 5 7Model Functions permutations as

black boxes that can be

queried at cost 1

N

N 0,1 N 13 0,13mmmm

d TEH FINI INI

ummm

AF E invents f it

PRIAMg x flirtyy c Fan VrICN E

Applications

keg recovery for DESdefine

f 256 s E as

DESCokay

sothen fired

Lt 56

9only use 56 ofthe 64 bit output

Trivial any F N CN

C invented with E N queries

in OTE N time

Lower BoundsThere are f that are

trivial to invent e g constant

o F uniformly randomurn

fNo T query A can

c invent F forC IN L

Preprocessing Non Uniformity

What if A has 5 bitsof advice about F

o 5 N logN

Space Time Complexity ofinventing functions

8exabyte

DES N256

f

s F N

t c

32 GB 6444years

assuming220 DES E

comp per Sec

213 225 233 243 253

kilo mega giga term exa Byte224 see per year 12 see per h

mm

Inverting Permutations2

IT NT sCNj

GENE xi.itXo

to

PO OH

If o

ofstove Xo Xp XeroOh challenge y apply it

untilsteelvalve is hit

Inverting random functions2

f CNI IN

a

o pick m starting pointsKi t k h

nocompute ki e ft Kia ic.cm

o store 7 kin Kiit ie Cud

i

sorted bymum

inverting

given g f find x

m E N m Ek y

C TNif m.EEN

Aable m

if m.EENPeaslee t

eg in E E eNwhat itIffeyed

f NI sous

pen gCNI CNT

flirtyf fl GH y pas

fait y

Boo

I m

Nit week N

S e m T E E

C nm eles T E.N

breaking Windows passwords237 complexity

Rainbow tablesmm

L

in i

Y'T

fr

sikn to tookNiko

O

on

coe

sikn u

so so

O

o

I

o

outoui si

kn

What if f is not

uniformly randommm

one

ogrand

3 GIFT t N

W m

T S T S N g

TT 091

Rainbow

1

TT 09

e

i