Pages that link to "Item:Q1019852"

The following pages link to Expander graphs based on GRH with an application to elliptic curve cryptography (Q1019852):

Displaying 19 items.

• Improved algorithm for the isogeny problem for ordinary elliptic curves (Q360194) (← links)
• A low-memory algorithm for finding short product representations in finite groups. (Q664395) (← links)
• Isogeny graphs of ordinary abelian varieties (Q680067) (← links)
• Quantum lattice enumeration and tweaking discrete pruning (Q1633464) (← links)
• On the hardness of the computational ring-LWR problem and its applications (Q1633465) (← links)
• Isolated elliptic curves and the MOV attack (Q1676235) (← links)
• Towards practical key exchange from ordinary isogeny graphs (Q1710681) (← links)
• CSIDH: an efficient post-quantum commutative group action (Q1710683) (← links)
• Post-quantum static-static key agreement using multiple protocol instances (Q1746952) (← links)
• A trade-off between classical and quantum circuit size for an attack against CSIDH (Q2027261) (← links)
• Threshold schemes from isogeny assumptions (Q2055691) (← links)
• Random self-reducibility of ideal-SVP via Arakelov random walks (Q2096524) (← links)
• A subexponential-time, polynomial quantum space algorithm for inverting the CM group action (Q2191211) (← links)
• Pseudorandom numbers and hash functions from iterations of multivariate polynomials (Q2380848) (← links)
• Computing the endomorphism ring of an ordinary elliptic curve over a finite field (Q2430982) (← links)
• Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation (Q2971023) (← links)
• Computing endomorphism rings of elliptic curves under the GRH (Q3096951) (← links)
• A proof of the conjectured run time of the Hafner-McCurley class group algorithm (Q6047436) (← links)
• Generating subgroups of ray class groups with small prime ideals (Q6165881) (← links)