activity
20072026
most citedImproved Analysis of Kannan's Shortest Lattice Vector Algorithm

136 citations · 201 across the 8 of their papers we have counts for

collaborators

8 papers

math.NT2026

Integer points close to a transcendental curve: an algorithmic approach

Nicolas Brisebarre, Guillaume Hanrot

In this article, we propose an algorithmic approach to determine the integer points located near a transcendental curve. This approach is closely related to a celebrated work by Bo…

cs.CR2025★ 1 cited

Fast Homomorphic Linear Algebra with BLAS

Youngjin Bae, Jung Hee Cheon, Guillaume Hanrot +2

Homomorphic encryption is a cryptographic paradigm allowing to compute on encrypted data, opening a wide range of applications in privacy-preserving data manipulation, notably in A…

cs.CR2024★ 9 cited

Fast and Accurate Homomorphic Softmax Evaluation

Wonhee Cho, Guillaume Hanrot, Taeseong Kim +2

Homomorphic encryption is one of the main solutions for building secure and privacy-preserving solutions for Machine Learning as a Service. This motivates the development of homomo…

cs.IT2014★ 15 cited

Markov Chain Monte Carlo Algorithms for Lattice Gaussian Sampling

Zheng Wang, Cong Ling, Guillaume Hanrot

Sampling from a lattice Gaussian distribution is emerging as an important problem in various areas such as coding and cryptography. The default sampling algorithm --- Klein's algor…

math.NT2010★ 23 cited

Visualizing elements of Sha[3] in genus 2 jacobians

Nils Bruin, Sander R. Dahmen

Mazur proved that any element xi of order three in the Shafarevich-Tate group of an elliptic curve E over a number field k can be made visible in an abelian surface A in the sense…

math.NT2008★ 16 cited

Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases

Guillaume Hanrot, Damien Stehlé

The Hermite-Korkine-Zolotarev reduction plays a central role in strong lattice reduction algorithms. By building upon a technique introduced by Ajtai, we show the existence of Herm…