We present an generator-based approach for efficient design space
exploration and high-level synthesis of cryptographic designs. It allows the directed search for new algorithmic
variants.
The approach combines high-level synthesis features like automated scheduling and allocation with
performance considerations down to the register-level which are
crucial for the performance of cryptographic designs.
We demonstrate the feasibility of this approach on an cryptographic algorithm based on elliptic curves.