#### Filter Results:

- Full text PDF available (22)

#### Publication Year

2000

2018

- This year (3)
- Last 5 years (9)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Laurent Fousse, Guillaume Hanrot, Vincent LefÃ¨vre, Patrick PÃ©lissier, Paul Zimmermann
- ACM Trans. Math. Softw.
- 2007

This article presents a multiple-precision binary floating-point library, written in the ISO C language, and based on the GNU MP library. Its particularity is to extend to arbitrary-precision, ideasâ€¦ (More)

- Guillaume Hanrot
- 2001

We prove that for n > 30, every n-th Lucas and Lehmer number has a primitive divisor. This allows us to list all Lucas and Lehmer numbers without a primitive divisor. Whether the mathematicians likeâ€¦ (More)

- Guillaume Hanrot, Xavier Pujol, Damien StehlÃ©
- CRYPTO
- 2011

Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL reduction, there haveâ€¦ (More)

- Guillaume Hanrot, Damien StehlÃ©
- CRYPTO
- 2007

The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upon the intractability of computing a shortest non-zero lattice vector and a closest lattice vectorâ€¦ (More)

- Guillaume Hanrot, Xavier Pujol, Damien StehlÃ©
- IWCC
- 2011

We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problems, namely theâ€¦ (More)

- Guillaume Hanrot, Michel Quercia, Paul Zimmermann
- Applicable Algebra in Engineering, Communicationâ€¦
- 2003

We present new algorithms for the inverse, division, and square root of power series. The key trick is a new algorithm â€“ MiddleProduct or, for short, MP â€“ computing the n middle coefficients of aâ€¦ (More)

We present new algorithms for the inverse, division, and square root of power series. The key trick is a new algorithm â€“ MiddleProduct or, for short, MP â€“ computing the n middle coefficients of aâ€¦ (More)

- JÃ©rÃ©mie Detrey, Guillaume Hanrot, Xavier Pujol, Damien StehlÃ©
- LATINCRYPT
- 2010

We describe an FPGA accelerator for the Kannanâ€“Finckeâ€“ Pohst enumeration algorithm (KFP) solving the Shortest Lattice Vector Problem (SVP). This is the first FPGA implementation of KFP specificallyâ€¦ (More)

- Guillaume Hanrot, Paul Zimmermann
- J. Symb. Comput.
- 2004

The short product of two power series is the meaningful part of the product of these objects, i.e., âˆ‘ i+ j<n ai b j xi+ j . Mulders (AAECC 11 (2000) 69) gives an algorithm to compute a short productâ€¦ (More)

- Laurent ThÃ©ry, Guillaume Hanrot
- TPHOLs
- 2007