Cryptology ePrint Archive: Report 2021/1061

Edwards curves and FFT-based multiplication

Pavel Atnashev and George Woltman

Abstract: This paper introduces fast algorithms for performing group operations on Edwards curves using FFT-based multiplication. Previously known algorithms can use such multiplication too, but better results can be achieved if particular properties of FFT-based arithmetic are accounted for. The introduced algorithms perform operations in extended Edwards coordinates and in Montgomery single coordinate.

Category / Keywords: Elliptic curves, Edwards curves, twisted Edwards curves, Montgomery curves.

Date: received 15 Aug 2021

Contact author: patnashev at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20210816:133040 (All versions of this report)

Short URL: ia.cr/2021/1061


[ Cryptology ePrint archive ]