ZINC 2020 - An Elliptic Curve Cryptographic Coprocessor for Resource Constrained Systems with...

Описание: An Elliptic Curve Cryptographic Coprocessor for Resource-Constrained Systems with Arithmetic over Solinas Primes and Arbitrary Prime Fields

Johann-Philipp Thiers and Malek Safieh (University of Applied Sciences, Konstanz, Germany); Juergen Freudenberger (University of Applied Sciences, Konstanz & Institute for System Dynamics (ISD), Germany)

Many resource-constrained systems still rely on symmetric cryptography for verification and authentication. Asymmetric cryptographic systems provide higher security levels, but are very computational intensive. Hence, embedded systems can benefit from hardware assistance, i.e., coprocessors optimized for the required public key operations. In this work, we propose an elliptic curve cryptographic coprocessors design for resource-constrained systems. Many such coprocessor designs consider only special (Solinas) prime fields, which enable a low-complexity modulo arithmetic. Other implementations support arbitrary prime curves using the Montgomery reduction. These implementations typically require more time for the point multiplication. We present a coprocessor design that has low area requirements and enables a trade-off between performance and flexibility. The point multiplication can be performed either using a fast arithmetic based on Solinas primes or using a slower, but flexible Montgomery modular arithmetic.