Implementing the Thull-Yap algorithm for computing Euclidean remainder sequences
François Morain
ISSAC2022 , Jul 2022, Villeneuve-d’Ascq, France
Conference papers
hal-03572271v2
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Solvability by Radicals from an Algorithmic Point of View
Guillaume Hanrot
,
François Morain
[Research Report] RR-4109, INRIA. 2001
Reports
inria-00072522v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Fast algorithms for computing isogenies between elliptic curves
Alin Bostan
,
Bruno Salvy
,
Francois Morain
,
Eric Schost
[Research Report] 2006, pp.28
Reports
inria-00091441v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
Razvan Barbulescu
,
Pierrick Gaudry
,
Aurore Guillevic
,
François Morain
Conference papers
hal-01112879v2
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Factoring Safe Semiprimes with a Single Quantum Query
Frédéric Grosshans
,
Thomas Lawson
,
Benjamin Smith
,
François Morain
2016
Preprints, Working Papers, ...
hal-01229587v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Building Carmichael numbers with a large number of prime factors and generalization to other numbers
D. Guillaume
,
François Morain
[Research Report] RR-1741, INRIA. 1992
Reports
inria-00076980v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Algorithms for computing isogenies between elliptic curves
Reynald Lercier
,
François Morain
Computational Perspectives on Number Theory , 1995, Chicago, United States. pp.77-96
Conference papers
hal-01102041v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Computing discrete logarithms in $GF(p^6)$
Laurent Grémy
,
Aurore Guillevic
,
François Morain
,
Emmanuel Thomé
Conference papers
hal-01624662v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Computing isogenies between elliptic curves over $GF(p^n)$ using Couveignes's algorithm
Reynald Lercier
,
François Morain
Journal articles
hal-01102025v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Speeding up the discrete log computation on curves with automorphisms
Iwan Duursma
,
Pierrick Gaudry
,
François Morain
Asiacrypt , 1999, Singapour, Singapore. pp.103-121
Conference papers
inria-00511639v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Discrete Logarithms
Aurore Guillevic
,
François Morain
Book sections
hal-01420485v2
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Discrete logarithm computations over finite fields using Reed-Solomon codes
Daniel Augot
,
François Morain
2012
Preprints, Working Papers, ...
hal-00672050v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
François Morain
2005
Preprints, Working Papers, ...
hal-00004136v2
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
BigNum : un module portable et efficace pour une arithmetique a precision arbitraire
Jean-Claude Herve
,
François Morain
,
David Salesin
,
Bernard Paul Serpette
,
Jean Vuillemin
,
et al.
[Rapport de recherche] RR-1016, INRIA. 1989
Reports
inria-00075542v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performances
Reynald Lercier
,
François Morain
Conference papers
hal-01102046v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Breaking DLP in $GF(p^5)$ using 3-dimensional sieving
Laurent Grémy
,
Aurore Guillevic
,
François Morain
2017
Preprints, Working Papers, ...
hal-01568373v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Deterministic factoring with oracles
François Morain
,
Guénaël Renault
,
Benjamin Smith
Journal articles
hal-01715832v2
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Building curves with arbitrary small MOV degree over finite prime fields
Régis Dupont
,
Andreas Enge
,
François Morain
Journal of Cryptology , 2005, 18 (2), pp.79-89
Journal articles
inria-00386299v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Improvements to the number field sieve for non-prime finite fields
Razvan Barbulescu
,
Pierrick Gaudry
,
Aurore Guillevic
,
François Morain
2022
Preprints, Working Papers, ...
hal-01052449v5
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Computing cardinalities of Q-curve reductions over finite fields
François Morain
,
Charlotte Scribot
,
Benjamin Smith
Journal articles
hal-01320388v3
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Modular curves over number fields and ECM
François Morain
Research in Number Theory , 2022
Journal articles
hal-03606355v2
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Using the Charlap-Coley-Robbins polynomials for computing isogenies
François Morain
2023
Preprints, Working Papers, ...
hal-04009243v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Factorization of a 512-bit RSA Modulus
Stefania Cavallar
,
Bruce Dodson
,
Arjen K. Lenstra
,
Walter Lioen
,
Peter L. Montgomery
,
et al.
International Conference on the Theory and Application of Cryptographic Techniques - EUROCRYPT 2000 , May 2000, Bruges, Belgium. pp.1-18,
⟨10.1007/3-540-45539-6_1⟩
Conference papers
inria-00099117v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Some factors of numbers of the form $b^n ± 1$ found using ECM with new classes of curves
François Morain
2022
Preprints, Working Papers, ...
hal-03437714v2
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts
Preda Mihailescu
,
François Morain
,
Eric Schost
2007
Other publications
inria-00130142v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Solvability by radicals from an algorithmic point of view
Guillaume Hanrot
,
François Morain
International Symposium on Symbolic and Algebraic Computation - ISSAC'2001 , 2001, London, Ontario, Canada, 18 p
Conference papers
inria-00100542v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm
Pierrick Gaudry
,
François Morain
ISSAC '06: Proceedings of the 2006 international symposium on symbolic and algebraic computation , Jul 2006, Genoa, Italy, pp.109 - 115,
⟨10.1145/1145768.1145791⟩
Conference papers
inria-00001009v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
Aurore Guillevic
,
François Morain
,
Emmanuel Thomé
Conference papers
hal-01320496v2
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Computing the Charlap-Coley-Robbins modular polynomials
François Morain
2023
Preprints, Working Papers, ...
hal-03980413v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Edwards curves and CM curves
François Morain
2009
Preprints, Working Papers, ...
inria-00375427v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More