Guillaume Hanrot - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2024

2019

Approx-SVP in Ideal Lattices with Pre-processingAlice Pellet-Mary, Guillaume Hanrot, Damien Stehlé. eurocrypt 2019: 685-716 [doi]

Approx-SVP in Ideal Lattices with Pre-processingAlice Pellet-Mary, Guillaume Hanrot, Damien Stehlé. iacr, 2019:215, 2019. [doi]

2018

A Lattice Basis Reduction Approach for the Design of Finite Wordlength FIR FiltersNicolas Brisebarre, Silviu-Ioan Filip, Guillaume Hanrot. tsp, 66(10):2673-2684, 2018. [doi]

2017

Exponential Sums and Correctly-Rounded FunctionsNicolas Brisebarre, Guillaume Hanrot, Olivier Robert. TC, 66(12):2044-2057, 2017. [doi]

2015

Corrigendum to "A long note on Mulders' short product" [J. Symb. Comput 37 (3) (2004) 391-401]Guillaume Hanrot, Paul Zimmermann. JSC, 66:111-112, 2015. [doi]

Formally Verified Certificate Checkers for Hardest-to-Round ComputationÉrik Martin-Dorel, Guillaume Hanrot, Micaela Mayero, Laurent Théry. JAR, 54(1):1-29, 2015. [doi]

2014

Markov chain Monte Carlo algorithms for lattice Gaussian samplingZheng Wang, Cong Ling, Guillaume Hanrot. isit 2014: 1489-1493 [doi]

2012

High-Throughput Hardware Architecture for the SWIFFT / SWIFFTX Hash FunctionsTamas Györfi, Octavian Cret, Guillaume Hanrot, Nicolas Brisebarre. iacr, 2012:343, 2012. [doi]

2011

Analyzing Blockwise Lattice Algorithms Using Dynamical SystemsGuillaume Hanrot, Xavier Pujol, Damien Stehlé. crypto 2011: 447-464 [doi]

Algorithms for the Shortest and Closest Lattice Vector ProblemsGuillaume Hanrot, Xavier Pujol, Damien Stehlé. codcry 2011: 159-190 [doi]

Terminating BKZGuillaume Hanrot, Xavier Pujol, Damien Stehlé. iacr, 2011:198, 2011. [doi]

2010

Accelerating Lattice Reduction with FPGAsJérémie Detrey, Guillaume Hanrot, Xavier Pujol, Damien Stehlé. latincrypt 2010: 124-143 [doi]

LLL: A Tool for Effective Diophantine ApproximationGuillaume Hanrot. In Phong Q. Nguyen, Brigitte Vallée, editors, The LLL Algorithm - Survey and Applications. Information Security and Cryptography, pages 215-263, Springer, 2010. [doi]

Constantes de Turán-Kubilius friables: une étude numériqueGuillaume Hanrot, Bruno Martin, Gerald Tenenbaum. em, 19(3):345-361, 2010. [doi]

2007

Floating-point L:::2:::-approximations to functionsNicolas Brisebarre, Guillaume Hanrot. arith 2007: 177-186 [doi]

Time-and space-efficient evaluation of some hypergeometric constantsHoward Cheng, Guillaume Hanrot, Emmanuel Thomé, Paul Zimmermann, Eugene V. Zima. issac 2007: 85-91 [doi]

MPFR: A multiple-precision binary floating-point library with correct roundingLaurent Fousse, Guillaume Hanrot, Vincent Lefèvre, Patrick Pélissier, Paul Zimmermann. TOMS, 33(2):13, 2007. [doi]

Improved Analysis of Kannan s Shortest Lattice Vector AlgorithmGuillaume Hanrot, Damien Stehlé. crypto 2007: 170-186 [doi]

Worst Cases of a Periodic Function for Large ArgumentsGuillaume Hanrot, Vincent Lefèvre, Damien Stehlé, Paul Zimmermann. arith 2007: 133-140 [doi]

Primality Proving with Elliptic CurvesLaurent Théry, Guillaume Hanrot. tphol 2007: 319-333 [doi]

2004

Proposal for a Standardization of Mathematical Function Implementation in Floating-Point ArithmeticDavid Defour, Guillaume Hanrot, Vincent Lefèvre, Jean-Michel Muller, Nathalie Revol, Paul Zimmermann. na, 37(1-4):367-375, 2004. [doi]

The Middle Product Algorithm IGuillaume Hanrot, Michel Quercia, Paul Zimmermann. aaecc, 14(6):415-438, 2004. [doi]

A long note on Mulders short productGuillaume Hanrot, Paul Zimmermann. JSC, 37(3):391-401, 2004. [doi]

2003

Density results on floating-point invertible numbersGuillaume Hanrot, Joël Rivat, G. Tenenbaum, Paul Zimmermann. TCS, 291(2):135-141, 2003.

2001

Solvability by radicals from an algorithmic point of viewGuillaume Hanrot, François Morain. issac 2001: 175-182 [doi]

2000

Solving Thue equations without the full unit groupGuillaume Hanrot. moc, 69(229):395-405, 2000.

Sign in or sign up to see more results.

runs on WebDSL