Guillaume Hanrot

42 papers A* 3B 3C 2Journal 26Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Correctly-Rounded Evaluation of a Function: Why, How, and at What Cost? ACM Comput. Surv. Nicolas Brisebarre, Guillaume Hanrot, Jean-Michel Muller, Paul Zimmermann
2026	J	`jnl`	Private Iris Recognition with High-Performance FHE. CoRR Jincheol Ha, Guillaume Hanrot, Taeyeong Noh, Jung Hee Cheon, Jung Woo Kim, Damien Stehlé
2026	J	`jnl`	Scaling up Privacy-Preserving ML: A CKKS Implementation of Llama-2-7B. CoRR Jaiyoung Park, Sejin Park, Jai Hyun Park, Jung Ho Ahn, Jung Hee Cheon, Guillaume Hanrot, Jung Woo Kim, Minje Park, Damien Stehlé
2025	J	`jnl`	Distributed Key Generation for Efficient Threshold-CKKS. IACR Cryptol. ePrint Arch. Seonhong Min, Guillaume Hanrot, Jai Hyun Park, Alain Passelègue, Damien Stehlé
2025	J	`jnl`	Fast Homomorphic Linear Algebra with BLAS. CoRR Youngjin Bae, Jung Hee Cheon, Guillaume Hanrot, Jai Hyun Park, Damien Stehlé
2025	—	`conf`	SHIP: A Shallow and Highly Parallelizable CKKS Bootstrapping Algorithm. EUROCRYPT (3) Jung Hee Cheon, Guillaume Hanrot, Jongmin Kim, Damien Stehlé
2025	J	`jnl`	SHIP: A Shallow and Highly Parallelizable CKKS Bootstrapping Algorithm. IACR Cryptol. ePrint Arch. Jung Hee Cheon, Guillaume Hanrot, Jongmin Kim, Damien Stehlé
2024	A*	`conf`	Fast and Accurate Homomorphic Softmax Evaluation. CCS Wonhee Cho, Guillaume Hanrot, Taeseong Kim, Minje Park, Damien Stehlé
2024	J	`jnl`	Fast and Accurate Homomorphic Softmax Evaluation. CoRR Wonhee Cho, Guillaume Hanrot, Taeseong Kim, Minje Park, Damien Stehlé
2024	—	`conf`	Plaintext-Ciphertext Matrix Multiplication and FHE Bootstrapping: Fast and Fused. CRYPTO (3) Youngjin Bae, Jung Hee Cheon, Guillaume Hanrot, Jai Hyun Park, Damien Stehlé
2024	J	`jnl`	Plaintext-Ciphertext Matrix Multiplication and FHE Bootstrapping: Fast and Fused. IACR Cryptol. ePrint Arch. Youngjin Bae, Jung Hee Cheon, Guillaume Hanrot, Jai Hyun Park, Damien Stehlé
2019	—	`conf`	Approx-SVP in Ideal Lattices with Pre-processing. EUROCRYPT (2) Alice Pellet-Mary, Guillaume Hanrot, Damien Stehlé
2019	J	`jnl`	Approx-SVP in Ideal Lattices with Pre-processing. IACR Cryptol. ePrint Arch. Alice Pellet-Mary, Guillaume Hanrot, Damien Stehlé
2018	J	`jnl`	A Lattice Basis Reduction Approach for the Design of Finite Wordlength FIR Filters. IEEE Trans. Signal Process. Nicolas Brisebarre, Silviu-Ioan Filip, Guillaume Hanrot
2017	J	`jnl`	Exponential Sums and Correctly-Rounded Functions. IEEE Trans. Computers Nicolas Brisebarre, Guillaume Hanrot, Olivier Robert
2015	J	`jnl`	Corrigendum to "A long note on Mulders' short product" [J. Symb. Comput 37 (3) (2004) 391-401]. J. Symb. Comput. Guillaume Hanrot, Paul Zimmermann
2015	J	`jnl`	Formally Verified Certificate Checkers for Hardest-to-Round Computation. J. Autom. Reason. Érik Martin-Dorel, Guillaume Hanrot, Micaela Mayero, Laurent Théry
2014	J	`jnl`	Markov Chain Monte Carlo Algorithms for Lattice Gaussian Sampling. CoRR Zheng Wang, Cong Ling, Guillaume Hanrot
2014	B	`conf`	Markov chain Monte Carlo algorithms for lattice Gaussian sampling. ISIT Zheng Wang, Cong Ling, Guillaume Hanrot
2012	J	`jnl`	High-Throughput Hardware Architecture for the SWIFFT / SWIFFTX Hash Functions. IACR Cryptol. ePrint Arch. Tamas Györfi, Octavian Cret, Guillaume Hanrot, Nicolas Brisebarre
2011	—	`conf`	Algorithms for the Shortest and Closest Lattice Vector Problems. IWCC Guillaume Hanrot, Xavier Pujol, Damien Stehlé
2011	A*	`conf`	Analyzing Blockwise Lattice Algorithms Using Dynamical Systems. CRYPTO Guillaume Hanrot, Xavier Pujol, Damien Stehlé
2011	J	`jnl`	Terminating BKZ. IACR Cryptol. ePrint Arch. Guillaume Hanrot, Xavier Pujol, Damien Stehlé
2010	—	`conf`	Accelerating Lattice Reduction with FPGAs. LATINCRYPT Jérémie Detrey, Guillaume Hanrot, Xavier Pujol, Damien Stehlé
2010	—	`ed.`	Algorithmic Number Theory, 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010. Proceedings ANTS Guillaume Hanrot, François Morain, Emmanuel Thomé
2010	J	`jnl`	Constantes de Turán-Kubilius friables: une étude numérique. Exp. Math. Guillaume Hanrot, Bruno Martin, Gerald Tenenbaum
2010	—	`ch.`	LLL: A Tool for Effective Diophantine Approximation. The LLL Algorithm Guillaume Hanrot
2008	J	`jnl`	Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases CoRR Guillaume Hanrot, Damien Stehlé
2007	C	`conf`	Floating-point L IEEE Symposium on Computer Arithmetic Nicolas Brisebarre, Guillaume Hanrot
2007	J	`jnl`	Improved Analysis of Kannan's Shortest Lattice Vector Algorithm CoRR Guillaume Hanrot, Damien Stehlé
2007	A*	`conf`	Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. CRYPTO Guillaume Hanrot, Damien Stehlé
2007	J	`jnl`	MPFR: A multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Softw. Laurent Fousse, Guillaume Hanrot, Vincent Lefèvre, Patrick Pélissier, Paul Zimmermann
2007	—	`conf`	Primality Proving with Elliptic Curves. TPHOLs Laurent Théry, Guillaume Hanrot
2007	J	`jnl`	Time- and Space-Efficient Evaluation of Some Hypergeometric Constants CoRR Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene V. Zima, Paul Zimmermann
2007	B	`conf`	Time-and space-efficient evaluation of some hypergeometric constants. ISSAC Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Paul Zimmermann, Eugene V. Zima
2007	C	`conf`	Worst Cases of a Periodic Function for Large Arguments. IEEE Symposium on Computer Arithmetic Guillaume Hanrot, Vincent Lefèvre, Damien Stehlé, Paul Zimmermann
2004	J	`jnl`	A long note on Mulders' short product. J. Symb. Comput. Guillaume Hanrot, Paul Zimmermann
2004	J	`jnl`	Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic. Numer. Algorithms David Defour, Guillaume Hanrot, Vincent Lefèvre, Jean-Michel Muller, Nathalie Revol, Paul Zimmermann
2004	J	`jnl`	The Middle Product Algorithm I. Appl. Algebra Eng. Commun. Comput. Guillaume Hanrot, Michel Quercia, Paul Zimmermann
2003	J	`jnl`	Density results on floating-point invertible numbers. Theor. Comput. Sci. Guillaume Hanrot, Joël Rivat, Gerald Tenenbaum, Paul Zimmermann
2001	B	`conf`	Solvability by radicals from an algorithmic point of view. ISSAC Guillaume Hanrot, François Morain
2000	J	`jnl`	Solving Thue equations without the full unit group. Math. Comput. Guillaume Hanrot