Slides for Wide block encryption
I have updated the slides to reflect use of GF[2^128]
multiplier. Encryption of 512 byte block requires
32 AES blocks and 32 GF[2^128] multipliers.
I estimate that hardware size (at given data rate)
for GF multiplier is about half that for AES with
128 bit key, and one third that for AES with 256 bit
key.
Slides include sketch of proof of security. Proof
is much simpler with GF multiplier than with modP
multiplier.
I am not ready to recommend this approach, but I do
think it provides an interesting comparison point.
I am particularly interested in John Viega's analysis
of how his ABL proposal compares to this in terms of
security and implementation cost.
blockEncryptionGf.ppt