arXiv · 2510.27375
Elliptic butterflies
Abstract
We study natural evaluation and interpolation problems for elliptic functions and prove that they allow a recursive treatment using a variant of classical butterflies first introduced by Gauss. We deduce the existence of straight-line programs with complexity scaling with $d\log(d)$ for these problems and present applications to finite field arithmetic, coding theory and cryptography.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jean-Marc Couveignes, Reynald Lercier. 2025-10-31. Elliptic butterflies. https://arxiv.org/abs/2510.27375
Cite the original work for its findings. Save a collection to share your selection of sources.