FFCSA - Finite Field Constructions, Search, and Algorithms
Abstract
In this work we present the new GAP package FFCSA - Finite Field Constructions, Search, and Algorithms. It was designed to enable Design Space Exploration for hardware implementations of cryptographic algorithms defined over finite fields. FFCSA constructions and searches are used to produce the design space, and FFCSA algorithms, parameterized for the current candidate field, are used to generate expressions needed for implementation in hardware.
Citation
Zidarič , N , Gong , G , Aagaard , M , Jurišić , A & Konovalov , O 2023 , ' FFCSA - Finite Field Constructions, Search, and Algorithms ' , ACM Communications in Computer Algebra , vol. 57 , no. 2 , pp. 57-64 . https://doi.org/10.1145/3614408.3614416
Publication
ACM Communications in Computer Algebra
Status
Peer reviewed
ISSN
1932-2240Type
Journal article
Description
The research of G. Gong and M. Aagaard were supported by NSERC Canada and the researchof N. Zidaric by NSERC Canada and NWO Netherlands through the PROACT project. The research of O.Konovalov was supported by the OpenDreamKit Horizon 2020 European Research Infrastructures projectCollections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.