A parallel S-box architecture for AES byte substitution

Hua Li · 2004

In this paper, a parallel S-box implementation is proposed. The original one S-box look-up table is separated into 32 small S-box look-up tables in order to parallel substitute the byte. By simulation, the average speed up of the proposed parallel byte substitution is 8 times faster than using the previous one S-box look-up table.

Read the paper · More papers on PaperTik