FFCSA - Finite Field Constructions, Search, and Algorithms

Nuša Zidarič*, Guang Gong, Mark Aagaard, Aleksandar Jurišić, Olexandr Konovalov

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)
12 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)57-64
Number of pages8
JournalACM Communications in Computer Algebra
Issue number2
Publication statusPublished - 7 Aug 2023


  • GAP
  • FSR
  • Finite field arithmetic
  • Cryptographic hardware


Dive into the research topics of 'FFCSA - Finite Field Constructions, Search, and Algorithms'. Together they form a unique fingerprint.

Cite this