Guénaël Renault

Orcid: 0000-0002-7050-9975

According to our database1, Guénaël Renault authored at least 38 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Deterministic factoring with oracles.
Appl. Algebra Eng. Commun. Comput., July, 2023

2022
Building a Commit-level Dataset of Real-world Vulnerabilities.
Proceedings of the CODASPY '22: Twelveth ACM Conference on Data and Application Security and Privacy, Baltimore, MD, USA, April 24, 2022

Security Assessment of NTRU Against Non-Profiled SCA.
Proceedings of the Smart Card Research and Advanced Applications, 2022

2021
Safe-Error Analysis of Post-Quantum Cryptography Mechanisms.
IACR Cryptol. ePrint Arch., 2021

Safe-Error Analysis of Post-Quantum Cryptography Mechanisms - Short Paper-.
Proceedings of the 18th Workshop on Fault Detection and Tolerance in Cryptography, 2021

On Using RSA/ECC Coprocessor for Ideal Lattice-Based Key Exchange.
Proceedings of the Constructive Side-Channel Analysis and Secure Design, 2021

2020
Speeding-up Ideal Lattice-Based Key Exchange Using a RSA/ECC Coprocessor.
IACR Cryptol. ePrint Arch., 2020

Attack on LAC Key Exchange in Misuse Situation.
IACR Cryptol. ePrint Arch., 2020

2019
Assessment of the Key-Reuse Resilience of NewHope.
IACR Cryptol. ePrint Arch., 2019

A probabilistic analysis on a lattice attack against DSA.
Des. Codes Cryptogr., 2019

2018
Quadratic Time Algorithm for Inversion of Binary Permutation Polynomials.
Proceedings of the Mathematical Software - ICMS 2018, 2018

2017
A Probabilistic Analysis on a Lattice Attack against DSA.
CoRR, 2017

2016
On the p-adic stability of the FGLM algorithm.
CoRR, 2016

Factoring N=p^rq^s for Large r and s.
Proceedings of the Topics in Cryptology - CT-RSA 2016 - The Cryptographers' Track at the RSA Conference 2016, San Francisco, CA, USA, February 29, 2016

Binary Permutation Polynomial Inversion and Application to Obfuscation Techniques.
Proceedings of the 2016 ACM Workshop on Software PROtection, 2016

Contribution à la Résolution Algébrique et Applications en Cryptologie.
, 2016

2015
Factoring N=p<sup>r</sup> q<sup>s</sup> for Large r and s.
IACR Cryptol. ePrint Arch., 2015

2014
Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm.
J. Cryptol., 2014

Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences.
IACR Cryptol. ePrint Arch., 2014

Sub-cubic change of ordering for Gröbner basis: a probabilistic approach.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
A Variant of Coppersmith's Algorithm with Improved Complexity and Efficient Exhaustive Search.
IACR Cryptol. ePrint Arch., 2013

Polynomial Systems Solving by Fast Linear Algebra
CoRR, 2013

Combined Attack on CRT-RSA - Why Public Verification Must Not Be Public?
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

2012
Efficient Arithmetic in Successive Algebraic Extension Fields Using Symmetries.
Math. Comput. Sci., 2012

Analysis of the algebraic side channel attack.
J. Cryptogr. Eng., 2012

Fast change of ordering with exponent ω.
ACM Commun. Comput. Algebra, 2012

Attacking (EC)DSA Given Only an Implicit Hint.
Proceedings of the Selected Areas in Cryptography, 19th International Conference, 2012

Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2011
New Subexponential Algorithms for Factoring in SL(2, fq).
IACR Cryptol. ePrint Arch., 2011

2010
Implicit Factoring with Shared Most Significant and Middle Bits.
Proceedings of the Public Key Cryptography, 2010

Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time.
Proceedings of the Pairing-Based Cryptography - Pairing 2010, 2010

2009
Computation schemes for splitting fields of polynomials.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008
Multi-modular algorithm for computing the splitting field of a polynomial.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2006
Computation of the splitting field of a dihedral polynomial.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

A Modular Method for Computing the Splitting Field of a Polynomial.
Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

2005
Note sur les relations entre les racines d'un polynéme réductible (Text in French).
RAIRO Theor. Informatics Appl., 2005

2004
Computation of the Decomposition Group of a Triangular Ideal.
Appl. Algebra Eng. Commun. Comput., 2004


  Loading...