Skip to Main content Skip to Navigation

inria-00386299v1  Journal articles
Régis DupontAndreas EngeFrançois Morain. Building curves with arbitrary small MOV degree over finite prime fields
Journal of Cryptology, Springer Verlag, 2005, 18 (2), pp.79-89
hal-01320496v2  Conference papers
Aurore GuillevicFrançois MorainEmmanuel Thomé. Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
Selected Areas in Cryptography -- SAC 2016, Aug 2016, St. Johns, Newfoundland, Canada. pp.559-578, ⟨10.1007/978-3-319-69453-5_30⟩
hal-01420485v2  Book sections
Aurore GuillevicFrançois Morain. Discrete Logarithms
Nadia El Mrabet; Marc Joye. Guide to pairing-based cryptography, CRC Press - Taylor and Francis Group, pp.42, 2016, 9781498729505
hal-01624662v1  Conference papers
Laurent GrémyAurore GuillevicFrançois MorainEmmanuel Thomé. Computing discrete logarithms in $GF(p^6)$
Selected Areas in Cryptography – SAC 2017, Aug 2017, Ottawa, Canada. pp.85-105, ⟨10.1007/978-3-319-72565-9_5⟩
inria-00385608v2  Journal articles
Andreas EngeFrançois Morain. Generalised Weber Functions
Acta Arithmetica, Instytut Matematyczny PAN, 2014, 164 (4), pp.309-341. ⟨10.4064/aa164-4-1⟩
inria-00564221v1  Journal articles
François Morain. Modular equations for some $\eta$-products
Acta Arithmetica, Instytut Matematyczny PAN, 2013, 161 (4), pp.26. ⟨10.4064/aa161-4-1⟩
inria-00001009v1  Conference papers
Pierrick GaudryFrançois Morain. Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm
ISSAC '06: Proceedings of the 2006 international symposium on symbolic and algebraic computation, Jul 2006, Genoa, Italy, pp.109 - 115, ⟨10.1145/1145768.1145791⟩
inria-00100542v1  Conference papers
Guillaume HanrotFrançois Morain. Solvability by radicals from an algorithmic point of view
International Symposium on Symbolic and Algebraic Computation - ISSAC'2001, 2001, London, Ontario, Canada, 18 p
inria-00099117v1  Conference papers
Stefania CavallarBruce DodsonArjen K. LenstraWalter LioenPeter L. Montgomery et al.  Factorization of a 512-bit RSA Modulus
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⟩
hal-01320388v3  Journal articles
François MorainCharlotte ScribotBenjamin Smith. Computing cardinalities of Q-curve reductions over finite fields
LMS Journal of Computation and Mathematics, London Mathematical Society, 2016, 19 (A), pp.15. ⟨10.1112/S1461157016000267⟩
inria-00544503v1  Directions of work or proceedings
Guillaume HanrotFrançois MorainEmmanuel Thomé. Algorithmic Number Theory. 9th. International Symposium, ANTS-IX. Nancy, France, July 2010. Proceedings
Guillaume Hanrot and François Morain and Emmanuel Thomé. 6197, Springer-Verlag, pp.397, 2010, Lecture Notes in Computer Science, 978-3-642-14518-6. ⟨10.1007/978-3-642-14518-6⟩