Computing newforms using supersingular isogeny graphs

نویسندگان

چکیده

We describe an algorithm that we used to compute the q-expansions of all weight 2 cusp forms prime level at most $$2,\!000,\!000$$ and dimension 6. also present verify there was only one form 7 or more per Atkin-Lehner eigenspace for levels between $$10,\!000$$ $$1,\!000,\!000$$ . Our is based on Mestre’s Méthode des Graphes, involves supersingular isogeny graphs Wiedemann’s finding minimal polynomial sparse matrices over finite fields.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hard and Easy Problems for Supersingular Isogeny Graphs

We consider the endomorphism ring computation problem for supersingular elliptic curves, constructive versions of Deuring’s correspondence, and the security of Charles-Goren-Lauter’s cryptographic hash function. We show that constructing Deuring’s correspondence is easy in one direction and equivalent to the endomorphism ring computation problem in the other direction. We also provide a collisi...

متن کامل

Faster Cryptographic Hash Function From Supersingular Isogeny Graphs

We propose a variant of the CGL hash [5] that is significantly faster than the original algorithm, and prove that it is preimage and collision resistant. For n = log p where p is the characteristic of the finite field, the performance ratio between CGL and the new proposal is (2n + 104.8)/(1.8 logn + 12.6). Assuming the best quantum preimage attack on the hash has complexityO(p 1 4 ), we attain...

متن کامل

On the Security of Supersingular Isogeny Cryptosystems

We study cryptosystems based on supersingular isogenies. This is an active area of research in post-quantum cryptography. Our first contribution is to give a very powerful active attack on the supersingular isogeny encryption scheme. This attack can only be prevented by using a (relatively expensive) countermeasure. Our second contribution is to show that the security of all schemes of this typ...

متن کامل

Fault Attack on Supersingular Isogeny Cryptosystems

We present the first fault attack on cryptosystems based on supersingular isogenies. During the computation of the auxiliary points, the attack aims to change the base point to a random point on the curve via a fault injection. We will show that this would reveal the secret isogeny with one successful perturbation with high probability. We will exhibit the attack by placing it against signature...

متن کامل

Signature Schemes Based On Supersingular Isogeny Problems

We present the first signature schemes whose security relies on computational assumptions relating to isogeny graphs of supersingular elliptic curves. We give two schemes, both of them based on interactive identification protocols. The first identification protocol is due to De Feo, Jao and Plût. The second one, and the main contribution of the paper, uses novel ideas that have not been used in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Research in number theory

سال: 2022

ISSN: ['2363-9555', '2522-0160']

DOI: https://doi.org/10.1007/s40993-022-00392-z