On the Parallelization of Square-Root Vélu’s Formulas
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 b...
| Published in: | Mathematical and Computational Applications |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-02-01
|
| Subjects: | |
| Online Access: | https://www.mdpi.com/2297-8747/29/1/14 |