| Improving the complexity of index calculus algorithms in elliptic curves over binary fields JC Faugère, L Perret, C Petit, G Renault Annual international conference on the theory and applications of …, 2012 | 92 | 2012 |
| Assessment of the key-reuse resilience of NewHope A Bauer, H Gilbert, G Renault, M Rossi Cryptographers’ track at the RSA conference, 272-292, 2019 | 58 | 2019 |
| Sub-cubic change of ordering for Gröbner basis: a probabilistic approach JC Faugère, P Gaudry, L Huot, G Renault Proceedings of the 39th International Symposium on Symbolic and Algebraic …, 2014 | 53 | 2014 |
| Using symmetries in the index calculus for elliptic curves discrete logarithm JC Faugère, P Gaudry, L Huot, G Renault Journal of Cryptology 27 (4), 595-635, 2014 | 44 | 2014 |
| Analysis of the algebraic side channel attack C Carlet, JC Faugere, C Goyet, G Renault Journal of Cryptographic Engineering 2 (1), 45-62, 2012 | 42 | 2012 |
| Implicit factoring with shared most significant and middle bits JC Faugère, R Marinier, G Renault Public Key Cryptography–PKC 2010: 13th International Conference on Practice …, 2010 | 37 | 2010 |
| Attacking (EC) DSA given only an implicit hint JC Faugere, C Goyet, G Renault International Conference on Selected Areas in Cryptography, 252-274, 2012 | 33 | 2012 |
| Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences J Bi, JS Coron, JC Faugère, PQ Nguyen, G Renault, R Zeitoun International Workshop on Public Key Cryptography, 185-202, 2014 | 32 | 2014 |
| Polynomial systems solving by fast linear algebra JC Faugère, P Gaudry, L Huot, G Renault arXiv preprint arXiv:1304.6039, 2013 | 30 | 2013 |
| Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time JG Kammerer, R Lercier, G Renault Pairing-Based Cryptography-Pairing 2010: 4th International Conference …, 2010 | 29 | 2010 |
| Factoring for Large r and s JS Coron, JC Faugère, G Renault, R Zeitoun Cryptographers’ Track at the RSA Conference, 448-464, 2016 | 26* | 2016 |
| Symmetrized summation polynomials: using small order torsion points to speed up elliptic curve index calculus JC Faugère, L Huot, A Joux, G Renault, V Vitse Annual International Conference on the Theory and Applications of …, 2014 | 24 | 2014 |
| A modular method for computing the splitting field of a polynomial G Renault, K Yokoyama Algorithmic Number Theory: 7th International Symposium, ANTS-VII, Berlin …, 2006 | 20 | 2006 |
| Attack on LAC key exchange in misuse situation A Greuet, S Montoya, G Renault Cryptology and Network Security: 19th International Conference, CANS 2020 …, 2020 | 18 | 2020 |
| Computation of the decomposition group of a triangular ideal I Abdeljaouad-Tej, S Orange, G Renault, A Valibouze Applicable Algebra in Engineering, Communication and Computing 15, 279-294, 2004 | 16 | 2004 |
| Calcul efficace de corps de décomposition S Orange, G Renault, A Valibouze LIP6, 2003 | 12* | 2003 |
| Combined attack on CRT-RSA: why public verification must not be public? G Barbu, A Battistello, G Dabosville, C Giraud, G Renault, S Renner, ... Public-Key Cryptography–PKC 2013: 16th International Conference on Practice …, 2013 | 10 | 2013 |
| New Subexponential Algorithms for Factoring in $ SL (2,\fq) $ JC Faugere, L Perret, C Petit, G Renault Cryptology ePrint Archive, 2011 | 10 | 2011 |
| Fast change of ordering with exponent ω JC Faugàre, P Gaudry, L Huot, G Renault ACM Communications in Computer Algebra 46 (3/4), 92-93, 2013 | 9 | 2013 |
| QUINTIC POLYNOMIALS OF HASHIMOTO–TSUNOGAI, BRUMER AND KUMMER M Kida, G Renault, K Yokoyama International Journal of Number Theory 5 (04), 555-571, 2009 | 9 | 2009 |
Louise HuotZweryfikowany adres z intel.com
