S-box Pipelining Using Genetic Algorithms for High-Throughput AES Implementations: How Fast Can We Go? (CROSBI ID 624998)
Prilog sa skupa u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Batina, Lejla ; Jakobović, Domagoj ; Mentens, Nele ; Picek, Stjepan ; de la Piedra, Antonio ; ŠiŠejković, Dominik
engleski
S-box Pipelining Using Genetic Algorithms for High-Throughput AES Implementations: How Fast Can We Go?
In the last few years, several practitioners have proposed a wide range of approaches for reducing the implementation area of the AES in hardware. However, an area-throughput trade-off that undermines high-speed is not realistic for real-time cryptographic applications. In this manuscript, we explore how Genetic Algorithms (GAs) can be used for pipelining the AES substitution box based on composite field arithmetic. We implemented a framework that parses and analyzes a Verilog netlist, abstracts it as a graph of interconnected cells and generates circuit statistics on its elements and paths. With this information, the GA extracts the appropriate arrangement of Flip-Flops (FFs) that maximizes the throughput of the given netlist. In doing so, we show that it is possible to achieve a 50 % improvement in throughput with only an 18 % increase in area in the UMC 0.13 μm low-leakage standard cell library.
genetic algorithms ; pipelining
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
322-337.
2014.
nije evidentirano
objavljeno
978-3-319-13039-2
Podaci o matičnoj publikaciji
Lecture notes in computer science
0302-9743
Podaci o skupu
Progress in Cryptology -- INDOCRYPT 2014
predavanje
14.12.2014-17.12.2014
New Delhi, Indija