Fingerprint
- 1 Similar Profiles
Collaborations and top research areas from the last five years
-
Elliptic Curves for Primality Proving
Morain, F., 1 Jan 2025, Encyclopedia of Cryptography, Security and Privacy, Third Edition. Springer Nature, p. 805-807 3 p.Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review
-
Deterministic factoring with oracles
Morain, F., Renault, G. & Smith, B., 1 Jul 2023, In: Applicable Algebra in Engineering, Communication and Computing. 34, 4, p. 663-690 28 p.Research output: Contribution to journal › Article › peer-review
Open Access -
Implementing the Thull-Yap Algorithm for Computing Euclidean Remainder Sequences
Morain, F., 4 Jul 2022, ISSAC 2022 - Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation47th International Symposium on Symbolic and Algebraic Computation, ISSAC 2022. Hashemi, A. (ed.). Association for Computing Machinery, p. 197-205 9 p. (Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Modular curves over number fields and ECM
Morain, F., 1 Dec 2022, In: Research in Number Theory. 8, 4, 97.Research output: Contribution to journal › Article › peer-review
-
Computing discrete logarithms in Fp6
Grémy, L., Guillevic, A., Morain, F. & Thomé, E., 1 Jan 2018, Selected Areas in Cryptography – SAC 2017 - 24th International Conference, Revised Selected Papers. Adams, C. & Camenisch, J. (eds.). Springer Verlag, p. 85-105 21 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10719 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Open Access -
Discrete logarithms
Guillevic, A. & Morain, F., 6 Jan 2017, Guide to Pairing-Based Cryptography. CRC Press, p. 9 1 p.Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review
-
Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction
Guillevic, A., Morain, F. & Thomé, E., 1 Jan 2017, Selected Areas in Cryptography – SAC 2016 - 23rd International Conference, Revised Selected Papers. Avanzi, R. & Heys, H. (eds.). Springer Verlag, p. 559-578 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10532 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Open Access -
Computing cardinalities of Q-curve reductions over finite fields
Morain, F., Scribot, C. & Smith, B., 1 Jan 2016, In: LMS Journal of Computation and Mathematics. 19, A, p. 115-129 15 p.Research output: Contribution to journal › Article › peer-review
Open Access -
Improving NFS for the discrete logarithm problem in non-prime finite fields
Barbulescu, R., Gaudry, P., Guillevic, A. & Morain, F., 1 Jan 2015, Advances in Cryptology – EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Fischlin, M. & Oswald, E. (eds.). Springer Verlag, p. 129-155 27 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9056).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Generalised Weber functions
Enge, A. & Morain, F., 1 Jan 2014, In: Acta Arithmetica. 164, 4, p. 309-341 33 p.Research output: Contribution to journal › Article › peer-review
Open Access