Tower field support for synthesis of datapaths

ACM International Conference on Computing Frontiers (CF), vol. 4, pp. 217–218

Abstract

With the rise of new technologies the demand for efficient cryptographic hardware and design space exploration is rising. This work presents a framework for the automated synthesis of datapaths that use tower-field constructions for finite field arithmetic. The key idea is a novel encoding of the underlying algebraic structure with the dual view as both a finite field and a vector space. The framework uses symbolic computation capabilities of GAP to generate the expressions, needed for hardware implementations, on-the-fly, and compiles them into synthesizable datapaths, test-vectors and testbenches. It supports implementation of expressions defined over different sized finite fields, tower fields, or even several isomorphic finite fields within the same hardware module.

Authors 2

1. Nuša Zidarič Aachen

   Leiden University

   Affiliation as printed

   LIACS, Leiden University, Leiden, Netherlands

2. Mark D. Aagaard

   University of Waterloo

   Affiliation as printed

   ECE, University of Waterloo, Waterloo, Canada