Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xavier Pujol

dblp:36/6544 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 1 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Cryptographic primitives and cryptanalysis · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography
0.222011
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems · CRYPTO 2011
Rigorous and Efficient Short Lattice Vectors Enumeration · ASIACRYPT 2008
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
lattice algorithms
0.112011
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems · CRYPTO 2011

Methods — techniques the papers use, named apart from their topics

dynamical systems · 0.1lattice reduction · 0.1enumeration algorithms · 0.1
YearPublicationVenuePosition
2011 Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
Guillaume Hanrot, Xavier Pujol, Damien Stehlé
CRYPTO2
2008 Rigorous and Efficient Short Lattice Vectors Enumeration
Xavier Pujol, Damien Stehlé
ASIACRYPT1
2007 Return of the hardware floating-point elementary function
abstract
The study of specific hardware circuits for the evaluation of floating-point elementary functions was once an active research area, until it was realized that these functions were not frequent enough to justify dedicating silicon to them. Research then turned to software functions. This situation may be about to change again with the advent of reconfigurable co-processors based on field-programmable gate arrays. Such co-processors now have a capacity that allows them to accomodate double-precision floating-point computing. Hardware operators for elementary functions targeted to such platforms have the potential to vastly outperform software functions, and will not permanently waste silicon resources. This article studies the optimization, for this target technology, of operators for the exponential and logarithm functions up to double-precision. These operators are freely available from www.ens-lyon.fr/LIP/ Arenaire/.
Jérémie Detrey, Florent de Dinechin, Xavier Pujol
IEEE Symposium on Computer Arithmetic3