Article
Version 1
Preserved in Portico This version is not peer-reviewed
On the Parallelization of Square-Root Vélu’s Formulas
Version 1
: Received: 17 January 2024 / Approved: 18 January 2024 / Online: 18 January 2024 (04:51:26 CET)
A peer-reviewed article of this Preprint also exists.
Chávez-Saab, J.; Ortega, O.; Pizarro-Madariaga, A. On the Parallelization of Square-Root Vélu’s Formulas. Math. Comput. Appl. 2024, 29, 14. Chávez-Saab, J.; Ortega, O.; Pizarro-Madariaga, A. On the Parallelization of Square-Root Vélu’s Formulas. Math. Comput. Appl. 2024, 29, 14.
Abstract
A primary challenge in isogeny-based cryptography lies in the substantial computational cost associated to computing and evaluating prime-degree isogenies. This computation traditionally relied on Vélu’s formulas, an approach with time complexity linear in the degree but which was further enhanced by Bernstein, De Feo, Leroux, and Smith to a square-root complexity. The improved square-root Vélu’s formulas exhibit a degree of parallelizability which has not been exploited in major implementations. In this study, we introduce a theoretical framework for parallelizing isogeny computations and provide a proof-of-concept implementation in C with OpenMP. While the parallelization effectiveness exhibits diminishing returns with the number of cores, we still obtain strong results when using a small number of cores. Concretely, our implementation shows that for large degrees it is easy to achieve speedup factors of up to 1.74, 2.54 and 3.44 for 2, 4 and 8 cores, respectively.
Keywords
isogenies; elliptic curves; parallelism; postquantum cryptography; efficient implementation
Subject
Computer Science and Mathematics, Computational Mathematics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment