The hardness of computing an eigenform
| dc.creator | Bach, Eric | |
| dc.creator | Charles, Denis | |
| dc.date | 2007-08-08 | |
| dc.date | 2007-08-13 | |
| dc.date.accessioned | 2026-07-07T08:23:02Z | |
| dc.date.available | 2026-07-07T08:23:02Z | |
| dc.description | In this article, we give evidence that computing Fourier coefficients of the Hecke eigenforms for composite indices is no easier than factoring integers. In particular, we show that the existence of a polynomial time algorithm that, given n, computes the n-th Fourier coefficient of a (fixed) Hecke eigenform implies that we can factor most RSA moduli (numbers that are products of two distinct primes) in polynomial time. | |
| dc.description | 5 Pages (corrected a typo in statement of Theorem 2.1) | |
| dc.identifier | https://arxiv.org/abs/0708.1192 | |
| dc.identifier | http://arxiv.org/abs/0708.1192 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/135851 | |
| dc.subject | Number Theory | |
| dc.subject | 11Y16, 68Q25 | |
| dc.title | The hardness of computing an eigenform | |
| dc.type | text |