Name
Abstract | ||
|---|---|---|
This paper presents a novel framework for the automatic pipelining of AES S-boxes using composite field representations. The framework is capable of finding positions to insert flip-flops in an almost optimal way, resulting in S-boxes with an almost optimal critical path. Our novel method is using memetic algorithms and is shown to be fast, reliable and successful. We demonstrate our framework for composite field S-boxes using a polynomial and a normal basis, respectively. Our results prove that this method should be consulted when an optimal solution is of interest. Besides experimental results with the new memetic algorithms, we also discuss the ideal model of a circuit, which can be used when assessing the quality of the obtained solutions. We emphasize that this method can be used for any circuit of interest and not only for AES S-boxes. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-31517-1_8 | AFRICACRYPT |
Field | DocType | Citations |
Memetic algorithm,Pipeline (computing),Polynomial,Computer science,Algorithm,Normal basis,Composite field,Critical path method,Distributed computing | Conference | 0 |
PageRank | References | Authors |
0.34 | 14 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stjepan Picek | 1 | 164 | 44.70 |
| Dominik Sisejkovic | 2 | 11 | 5.06 |
| Domagoj Jakobovic | 3 | 195 | 29.01 |
| Lejla Batina | 4 | 1488 | 107.99 |
| Bohan Yang | 5 | 107 | 10.07 |
| Danilo Sijacic | 6 | 0 | 0.34 |
| Nele Mentens | 7 | 394 | 47.72 |