Bitslice Implementation

X0 :=X0 xor X1 xor X3

X2 := X2 xor X3 xor

(X1<ɟ)

X0 := X0<<ɝ

X2 := X2<<ឆ

Bi+1 := X0 X1 X2 X3

? Linear Transformation (LT)

X0X1 X2 X3 := Si(Bi xor Ki)

X0 :=X0 <<᝽

X2 :=X2 <<ɛ

X1 :=X1 xor X0 xor X2

X3 :=X3 xor X2 xor

(X0 <ɛ)

X1 :=X1 <<ə

X3 :=X3 <<ɟ

? No IP and FP required

? S-box implemented as sequence of logic operations

Previous slide

Next slide

Back to first slide

View graphic version