An elliptic curve cryptographic processor using edwards curves and the number theoretic transform

Abstract

Hardware implementations of ECC processors based on Edwards curves are very useful for various applications of security due to the regularity of point operations. In this paper we explore one such direction taking advantage of the DFT modular multiplication in a special composite field of a prime characteristic. Our results show potential in terms of compactness while maintaining a feasible latency. We expect this approach to be more beneficial for side-channel security. © 2016 Elsevier B.V., All rights reserved.