Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.27375 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910058140401664 |
|---|---|
| author | Couveignes, Jean-Marc Lercier, Reynald |
| author_facet | Couveignes, Jean-Marc Lercier, Reynald |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_27375 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Elliptic butterflies Couveignes, Jean-Marc Lercier, Reynald Number Theory 11T24, 14H52 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. |
| title | Elliptic butterflies |
| topic | Number Theory 11T24, 14H52 |
| url | https://arxiv.org/abs/2510.27375 |