Guillaume Hanrot

Orcid: 0000-0001-9319-0365

According to our database1, Guillaume Hanrot authored at least 28 papers between 2000 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Plaintext-Ciphertext Matrix Multiplication and FHE Bootstrapping: Fast and Fused.
IACR Cryptol. ePrint Arch., 2024

Fast and Accurate Homomorphic Softmax Evaluation.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2019
Approx-SVP in Ideal Lattices with Pre-processing.
IACR Cryptol. ePrint Arch., 2019

2018
A Lattice Basis Reduction Approach for the Design of Finite Wordlength FIR Filters.
IEEE Trans. Signal Process., 2018

2017
Exponential Sums and Correctly-Rounded Functions.
IEEE Trans. Computers, 2017

2015
Corrigendum to "A long note on Mulders' short product" [J. Symb. Comput 37 (3) (2004) 391-401].
J. Symb. Comput., 2015

Formally Verified Certificate Checkers for Hardest-to-Round Computation.
J. Autom. Reason., 2015

2014
Markov chain Monte Carlo algorithms for lattice Gaussian sampling.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2012
High-Throughput Hardware Architecture for the SWIFFT / SWIFFTX Hash Functions.
IACR Cryptol. ePrint Arch., 2012

2011
Terminating BKZ.
IACR Cryptol. ePrint Arch., 2011

Analyzing Blockwise Lattice Algorithms Using Dynamical Systems.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Algorithms for the Shortest and Closest Lattice Vector Problems.
Proceedings of the Coding and Cryptology - Third International Workshop, 2011

2010
LLL: A Tool for Effective Diophantine Approximation.
Proceedings of the LLL Algorithm - Survey and Applications, 2010

Constantes de Turán-Kubilius friables: une étude numérique.
Exp. Math., 2010

Accelerating Lattice Reduction with FPGAs.
Proceedings of the Progress in Cryptology, 2010

2008
Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases
CoRR, 2008

2007
MPFR: A multiple-precision binary floating-point library with correct rounding.
ACM Trans. Math. Softw., 2007

Primality Proving with Elliptic Curves.
Proceedings of the Theorem Proving in Higher Order Logics, 20th International Conference, 2007

Time-and space-efficient evaluation of some hypergeometric constants.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Improved Analysis of Kannan's Shortest Lattice Vector Algorithm.
Proceedings of the Advances in Cryptology, 2007

Worst Cases of a Periodic Function for Large Arguments.
Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH-18 2007), 2007

Floating-point L<sup>2</sup>-approximations to functions.
Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH-18 2007), 2007

2004
Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic.
Numer. Algorithms, 2004

A long note on Mulders' short product.
J. Symb. Comput., 2004

The Middle Product Algorithm I.
Appl. Algebra Eng. Commun. Comput., 2004

2003
Density results on floating-point invertible numbers.
Theor. Comput. Sci., 2003

2001
Solvability by radicals from an algorithmic point of view.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

2000
Solving Thue equations without the full unit group.
Math. Comput., 2000


  Loading...