default search action
Guillaume Hanrot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Wonhee Cho, Guillaume Hanrot, Taeseong Kim, Minje Park, Damien Stehlé:
Fast and Accurate Homomorphic Softmax Evaluation. CCS 2024: 4391-4404 - [c12]Youngjin Bae
, Jung Hee Cheon, Guillaume Hanrot
Plaintext-Ciphertext Matrix Multiplication and FHE Bootstrapping: Fast and Fused. CRYPTO (3) 2024: 387-421 - [i9]Wonhee Cho, Guillaume Hanrot, Taeseong Kim, Minje Park, Damien Stehlé:
Fast and Accurate Homomorphic Softmax Evaluation. CoRR abs/2410.11184 (2024) - [i8]Youngjin Bae, Jung Hee Cheon, Guillaume Hanrot, Jai Hyun Park, Damien Stehlé:
Plaintext-Ciphertext Matrix Multiplication and FHE Bootstrapping: Fast and Fused. IACR Cryptol. ePrint Arch. 2024: 1284 (2024)
2010 – 2019
- 2019
- [c11]Alice Pellet-Mary, Guillaume Hanrot, Damien Stehlé:
Approx-SVP in Ideal Lattices with Pre-processing. EUROCRYPT (2) 2019: 685-716 - [i7]Alice Pellet-Mary, Guillaume Hanrot, Damien Stehlé:
Approx-SVP in Ideal Lattices with Pre-processing. IACR Cryptol. ePrint Arch. 2019: 215 (2019) - 2018
- [j11]Nicolas Brisebarre
A Lattice Basis Reduction Approach for the Design of Finite Wordlength FIR Filters. IEEE Trans. Signal Process. 66(10): 2673-2684 (2018) - 2017
- [j10]Nicolas Brisebarre
Exponential Sums and Correctly-Rounded Functions. IEEE Trans. Computers 66(12): 2044-2057 (2017) - 2015
- [j9]Érik Martin-Dorel, Guillaume Hanrot, Micaela Mayero, Laurent Théry:
Formally Verified Certificate Checkers for Hardest-to-Round Computation. J. Autom. Reason. 54(1): 1-29 (2015) - [j8]Guillaume Hanrot, Paul Zimmermann:
Corrigendum to "A long note on Mulders' short product" [J. Symb. Comput 37 (3) (2004) 391-401]. J. Symb. Comput. 66: 111-112 (2015) - 2014
- [c10]Zheng Wang, Cong Ling, Guillaume Hanrot:
Markov chain Monte Carlo algorithms for lattice Gaussian sampling. ISIT 2014: 1489-1493 - [i6]Zheng Wang, Cong Ling, Guillaume Hanrot:
Markov Chain Monte Carlo Algorithms for Lattice Gaussian Sampling. CoRR abs/1405.1623 (2014) - 2012
- [i5]Tamas Györfi, Octavian Cret, Guillaume Hanrot, Nicolas Brisebarre:
High-Throughput Hardware Architecture for the SWIFFT / SWIFFTX Hash Functions. IACR Cryptol. ePrint Arch. 2012: 343 (2012) - 2011
- [c9]Guillaume Hanrot, Xavier Pujol, Damien Stehlé:
Algorithms for the Shortest and Closest Lattice Vector Problems. IWCC 2011: 159-190 - [c8]Guillaume Hanrot, Xavier Pujol, Damien Stehlé:
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems. CRYPTO 2011: 447-464 - [i4]Guillaume Hanrot, Xavier Pujol, Damien Stehlé:
Terminating BKZ. IACR Cryptol. ePrint Arch. 2011: 198 (2011) - 2010
- [j7]Guillaume Hanrot, Bruno Martin, Gerald Tenenbaum
Constantes de Turán-Kubilius friables: une étude numérique. Exp. Math. 19(3): 345-361 (2010) - [c7]Jérémie Detrey, Guillaume Hanrot, Xavier Pujol, Damien Stehlé:
Accelerating Lattice Reduction with FPGAs. LATINCRYPT 2010: 124-143 - [p1]Guillaume Hanrot:
LLL: A Tool for Effective Diophantine Approximation. The LLL Algorithm 2010: 215-263 - [e1]Guillaume Hanrot, François Morain, Emmanuel Thomé
Algorithmic Number Theory, 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010. Proceedings. Lecture Notes in Computer Science 6197, Springer 2010, ISBN 978-3-642-14517-9 [contents]
2000 – 2009
- 2008
- [i3]Guillaume Hanrot, Damien Stehlé:
Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases. CoRR abs/0801.3331 (2008) - 2007
- [j6]Laurent Fousse, Guillaume Hanrot, Vincent Lefèvre, Patrick Pélissier, Paul Zimmermann
MPFR: A multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Softw. 33(2): 13 (2007) - [c6]Guillaume Hanrot, Vincent Lefèvre, Damien Stehlé, Paul Zimmermann:
Worst Cases of a Periodic Function for Large Arguments. IEEE Symposium on Computer Arithmetic 2007: 133-140 - [c5]Nicolas Brisebarre, Guillaume Hanrot:
Floating-point L2-approximations to functions. IEEE Symposium on Computer Arithmetic 2007: 177-186 - [c4]Guillaume Hanrot, Damien Stehlé:
Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. CRYPTO 2007: 170-186 - [c3]Howard Cheng, Guillaume Hanrot, Emmanuel Thomé
Time-and space-efficient evaluation of some hypergeometric constants. ISSAC 2007: 85-91 - [c2]Laurent Théry, Guillaume Hanrot:
Primality Proving with Elliptic Curves. TPHOLs 2007: 319-333 - [i2]Guillaume Hanrot, Damien Stehlé:
Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. CoRR abs/0705.0965 (2007) - [i1]Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene V. Zima, Paul Zimmermann:
Time- and Space-Efficient Evaluation of Some Hypergeometric Constants. CoRR abs/cs/0701151 (2007) - 2004
- [j5]Guillaume Hanrot, Michel Quercia, Paul Zimmermann:
The Middle Product Algorithm I. Appl. Algebra Eng. Commun. Comput. 14(6): 415-438 (2004) - [j4]Guillaume Hanrot, Paul Zimmermann:
A long note on Mulders' short product. J. Symb. Comput. 37(3): 391-401 (2004) - [j3]David Defour, Guillaume Hanrot, Vincent Lefèvre, Jean-Michel Muller
Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic. Numer. Algorithms 37(1-4): 367-375 (2004) - 2003
- [j2]Guillaume Hanrot, Joël Rivat, Gerald Tenenbaum, Paul Zimmermann:
Density results on floating-point invertible numbers. Theor. Comput. Sci. 291(2): 135-141 (2003) - 2001
- [c1]Guillaume Hanrot, François Morain:
Solvability by radicals from an algorithmic point of view. ISSAC 2001: 175-182 - 2000
- [j1]Guillaume Hanrot:
Solving Thue equations without the full unit group. Math. Comput. 69(229): 395-405 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-11 20:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: