( en | de | ru )

 

Disambiguation of "Morain, François"

Author of the publication

copydeleteadd this publication to your clipboard
Proving the Primality of Very Large Numbers with fastECPP.

, , , and . ANTS, volume 3076 of Lecture Notes in Computer Science, page 194-207. Springer, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

François Weirich

François Elvinger

François Guers

François Buscot

François Renaud

 

Other publications of authors with the same name

Improvements to the number field sieve for non-prime finite fields., , , and . CoRR, (2014)Elliptic Curves for Primality Proving.. Encyclopedia of Cryptography and Security (2nd Ed.), Springer, (2011)Building Elliptic Curves Modulo Large Primes.. EUROCRYPT, volume 547 of Lecture Notes in Computer Science, page 328-336. Springer, (1991)Deterministic factoring with oracles., , and . CoRR, (2018)Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts., , and . ISSAC, page 285-292. ACM, (2007)Primality Proving Using Elliptic Curves: An Update.. ANTS, volume 1423 of Lecture Notes in Computer Science, page 111-127. Springer, (1998)Building pseudoprimes with a large number of prime factors., and . Appl. Algebra Eng. Commun. Comput., 7 (4): 263-277 (1996)Solvability by radicals from an algorithmic point of view., and . ISSAC, page 175-182. ACM, (2001)Elliptic Curves for Primality Proving.. Encyclopedia of Cryptography and Security, Springer, (2005)Distributed Primality Proving and the Primality of (23539+1)/3.. EUROCRYPT, volume 473 of Lecture Notes in Computer Science, page 110-123. Springer, (1990)