The SCEAS System
Navigation Menu

Search the dblp DataBase


François Morain: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andreas Enge, François Morain
    Fast Decomposition of Polynomials with Known Galois Group. [Citation Graph (0, 0)][DBLP]
    AAECC, 2003, pp:254-264 [Conf]
  2. Andreas Enge, François Morain
    Comparing Invariants for Class Fields of Imaginary Quadratic Fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 2002, pp:252-266 [Conf]
  3. Mireille Fouquet, François Morain
    Isogeny Volcanoes and the SEA Algorithm. [Citation Graph (0, 0)][DBLP]
    ANTS, 2002, pp:276-291 [Conf]
  4. J. Franke, T. Kleinjung, François Morain, T. Wirth
    Proving the Primality of Very Large Numbers with fastECPP. [Citation Graph (0, 0)][DBLP]
    ANTS, 2004, pp:194-207 [Conf]
  5. Jean Marc Couveignes, François Morain
    Schoof's algorithm and isogeny cycles. [Citation Graph (0, 0)][DBLP]
    ANTS, 1994, pp:43-58 [Conf]
  6. François Morain
    Primality Proving Using Elliptic Curves: An Update. [Citation Graph (0, 0)][DBLP]
    ANTS, 1998, pp:111-127 [Conf]
  7. Iwan M. Duursma, Pierrick Gaudry, François Morain
    Speeding up the Discrete Log Computation on Curves with Automorphisms. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1999, pp:103-121 [Conf]
  8. Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman te Riele, Karen Aardal, Jeff Gilchrist, Gérard Guillerm, Paul C. Leyland, Joël Marchand, François Morain, Alec Muffett, Chris Putnam, Craig Putnam, Paul Zimmermann
    Factorization of a 512-Bit RSA Modulus. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:1-18 [Conf]
  9. François Morain
    Atkin's Test: News From the Front. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1989, pp:626-635 [Conf]
  10. François Morain
    Distributed Primality Proving and the Primality of (23539+1)/3. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:110-123 [Conf]
  11. François Morain
    Building Elliptic Curves Modulo Large Primes. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:328-336 [Conf]
  12. Reynald Lercier, François Morain
    Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1995, pp:79-94 [Conf]
  13. Guillaume Hanrot, François Morain
    Solvability by radicals from an algorithmic point of view. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:175-182 [Conf]
  14. François Morain
    Easy Numbers for the Elliptic Curve Primality Proving Algorithm. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1992, pp:263-268 [Conf]
  15. Pierrick Gaudry, François Morain
    Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2006, pp:109-115 [Conf]
  16. D. Guillaume, François Morain
    Building Psudoprimes with a Large Number of Prime Factors. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1996, v:7, n:4, pp:263-277 [Journal]
  17. Régis Dupont, Andreas Enge, François Morain
    Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2005, v:18, n:2, pp:79-89 [Journal]
  18. Reynald Lercier, François Morain
    Computing isogenies between elliptic curves over Fpn using Couveignes's algorithm. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2000, v:69, n:229, pp:351-370 [Journal]
  19. P. Mihailescu, François Morain, Éric Schost
    Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2007, pp:285-292 [Conf]
  20. Alin Bostan, Bruno Salvy, François Morain, Éric Schost
    Fast algorithms for computing isogenies between elliptic curves [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

Search in 0.077secs, Finished in 0.078secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002