FFCSA - Finite Field Constructions, Search, and Algorithms

ACM communications in computer algebra, vol. 57, pp. 57–64

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.

Authors 5

1. Nuša Zidarič Aachen Leiden Institute of Advanced Computer Science

   Leiden University

   Affiliation as printed

   Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Leiden, The Netherlands

2. Guang Gong

   University of Waterloo

   Affiliation as printed

   Electrical and Computer Engineering, University of Waterloo, Waterloo, Canada

3. Mark D. Aagaard

   University of Waterloo

   Affiliation as printed

   Electrical and Computer Engineering, University of Waterloo, Waterloo, Canada

4. Aleksandar Jurišić

   University of Ljubljana

   Affiliation as printed

   Faculty of Computer and Information Science, University of Ljubljana, Ljubljana, Slovenija

5. Olexandr Konovalov

   University of St Andrews

   Affiliation as printed

   School of Computer Science, University of St Andrews, St Andrews, Scotland