Paper 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.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- Elliptic curvesEdwards curvestwisted Edwards curvesMontgomery curves.
- Contact author(s)
- patnashev @ gmail com
- History
- 2021-08-16: received
- Short URL
- https://ia.cr/2021/1061
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/1061,
author = {Pavel Atnashev and George Woltman},
title = {Edwards curves and {FFT}-based multiplication},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/1061},
year = {2021},
url = {https://eprint.iacr.org/2021/1061}
}
