Extreme Pipelining Towards the Best Area-Performance Trade-Off in Hardware
Autor: | Picek, S., Sisejkovic, D., Jakobovic, D., Batina, L., Yang, B., Sijacic, D., Mentens, N., Pointcheval, D., Nitaj, A., Rachidi, T. |
---|---|
Přispěvatelé: | Pointcheval, David, Nitaj, Abderrahmane, Rachidi, Tajjeeddine, Pointcheval, D., Nitaj, A., Rachidi, T. |
Rok vydání: | 2016 |
Předmět: |
Polynomial
Ideal (set theory) Computer science Pipeline (computing) media_common.quotation_subject 02 engineering and technology Real-time cryptography Pipelining AES S-box Memetic algorithm 020202 computer hardware & architecture Normal basis 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Quality (business) Digital Security Critical path method Algorithm media_common |
Zdroj: | Progress in Cryptology – AFRICACRYPT 2016 ISBN: 9783319315164 AFRICACRYPT Progress in Cryptology – AFRICACRYPT 2016 Pointcheval, D.; Nitaj, A.; Rachidi, T. (ed.), Progress in Cryptology – AFRICACRYPT 2016: 8th International Conference on Cryptology in Africa, Fes, Morocco, April 13-15, 2016, Proceedings, pp. 147-166 Pointcheval, D.; Nitaj, A.; Rachidi, T. (ed.), Progress in Cryptology – AFRICACRYPT 2016: 8th International Conference on Cryptology in Africa, Fes, Morocco, April 13-15, 2016, Proceedings, 147-166. Cham : Springer International Publishing STARTPAGE=147;ENDPAGE=166;TITLE=Pointcheval, D.; Nitaj, A.; Rachidi, T. (ed.), Progress in Cryptology – AFRICACRYPT 2016: 8th International Conference on Cryptology in Africa, Fes, Morocco, April 13-15, 2016, Proceedings Lecture Notes in Computer Science Lecture Notes in Computer Science-Progress in Cryptology – AFRICACRYPT 2016 |
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/978-3-319-31517-1_8 |
Popis: | © Springer International Publishing Switzerland 2016. 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. ispartof: pages:147-166 ispartof: Lecture Notes in Computer Science vol:9646 pages:147-166 ispartof: International Conference on Cryptology in Africa (Africacrypt) date:13 Apr - 15 Apr 2016 status: published |
Databáze: | OpenAIRE |
Externí odkaz: |
načítá se...