The following pages link to François Morain (Q814846):
Displaying 43 items.
- Building curves with arbitrary small MOV degree over finite prime fields (Q814847) (← links)
- Computing the cardinality of CM elliptic curves using torsion points (Q933164) (← links)
- (Q1358794) (redirect page) (← links)
- Coverings of elliptic curves with complex multiplication by hyperelliptic curves and character sums (Q1358795) (← links)
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
- Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
- On character sums related to elliptic curves with complex multiplication (Q1903505) (← links)
- Discovery of a lost factoring machine (Q1908699) (← links)
- Computing the number of points on an elliptic curve over a finite field: algorithmic aspects (Q1909876) (← links)
- Modular curves over number fields and ECM (Q2100579) (← links)
- Modular equations for some η-products (Q2867689) (← links)
- Generalised Weber functions (Q2875425) (← links)
- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields (Q2948326) (← links)
- Solvability by radicals from an algorithmic point of view (Q2958928) (← links)
- Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm (Q2958977) (← links)
- Elliptic Curves and Primality Proving (Q3137447) (← links)
- (Q3361891) (← links)
- Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (Q3420443) (← links)
- Corrigenda (Q3476872) (← links)
- Fast algorithms for computing isogenies between elliptic curves (Q3577024) (← links)
- On the lcm of the Differences of Eight Primes (Q3809853) (← links)
- (Q3840154) (← links)
- (Q4010515) (← links)
- (Q4036863) (← links)
- Building Cyclic Elliptic Curves Modulo Large Primes (Q4037477) (← links)
- (Q4213384) (← links)
- (Q4224300) (← links)
- (Q4234249) (← links)
- (Q4276337) (← links)
- Finding Suitable Curves for the Elliptic Curve Method of Factorization (Q4293979) (← links)
- (Q4378187) (← links)
- Fast Decomposition of Polynomials with Known Galois Group (Q4426704) (← links)
- (Q4502491) (← links)
- Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm (Q4700202) (← links)
- (Q4737490) (← links)
- (Q4737492) (← links)
- (Q4831122) (← links)
- (Q4847913) (← links)
- (Q4871719) (← links)
- Speeding up the computations on an elliptic curve using addition-subtraction chains (Q5202278) (← links)
- (Q5301683) (← links)
- Using Fricke modular polynomials to compute isogenies (Q6521750) (← links)
- Implementing the thull-yap algorithm for computing Euclidean remainder sequences (Q6665754) (← links)
