What is he best known for?
The fields of study he is best known for:
- Algebra
- Cryptography
- Real number
Damien Stehlé mainly focuses on Discrete mathematics, Cryptography, Lattice problem, Homomorphic encryption and Lattice reduction.
His Discrete mathematics research incorporates elements of Dimension, Multilinear map, Security parameter and Combinatorics.
His Cryptography research is multidisciplinary, incorporating perspectives in Lattice and Theoretical computer science.
His studies in Lattice problem integrate themes in fields like Learning with errors and Public-key cryptography.
Damien Stehlé has researched Homomorphic encryption in several fields, including Base, Bounded function, Functional encryption and Product.
He focuses mostly in the field of Ideal, narrowing it down to topics relating to Multiplicative function and, in certain cases, Algorithm.
His most cited work include:
- Classical hardness of learning with errors (346 citations)
- Faster Fully Homomorphic Encryption (266 citations)
- Making NTRU as secure as worst-case problems over ideal lattices (257 citations)
What are the main themes of his work throughout his whole career to date?
His primary scientific interests are in Discrete mathematics, Lattice, Lattice reduction, Combinatorics and Lattice problem.
Damien Stehlé combines subjects such as Homomorphic encryption, Security parameter, Decoding methods, Bounded function and Learning with errors with his study of Discrete mathematics.
His Lattice research includes themes of Norm and Tuple.
His Combinatorics research is multidisciplinary, relying on both Integer lattice, Lattice sieving and Hermite polynomials.
The various areas that he examines in his Lattice problem study include Dimension, NTRU, Quantum computer and Reduction.
His biological study spans a wide range of topics, including Basis and Numerical stability.
He most often published in these fields:
- Discrete mathematics (50.86%)
- Lattice (36.21%)
- Lattice reduction (34.48%)
What were the highlights of his more recent work (between 2018-2021)?
- Combinatorics (35.34%)
- Discrete mathematics (50.86%)
- Integer (11.21%)
In recent papers he was focusing on the following fields of study:
Combinatorics, Discrete mathematics, Integer, Random oracle and Polynomial are his primary areas of study.
His Enumeration study, which is part of a larger body of work in Combinatorics, is frequently linked to Lattice reduction and Root, bridging the gap between disciplines.
Discrete mathematics and Learning with errors are frequently intertwined in his study.
His research investigates the connection between Learning with errors and topics such as Product that intersect with issues in Digital signature.
His Digital signature study combines topics from a wide range of disciplines, such as Lattice and Post-quantum cryptography.
His study explores the link between Random oracle and topics such as Mathematical proof that cross with problems in Public-key cryptography.
Between 2018 and 2021, his most popular works were:
- Approx-SVP in Ideal Lattices with Pre-processing (13 citations)
- Measure-Rewind-Measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security (7 citations)
- An LLL Algorithm for Module Lattices (5 citations)
In his most recent research, the most cited papers focused on:
- Algebra
- Real number
- Cryptography
Damien Stehlé spends much of his time researching Discrete mathematics, Digital signature, Random oracle, Algebraic number field and Ring of integers.
His study in Discrete mathematics is interdisciplinary in nature, drawing from both Mathematical proof, Lemma, Scheme, Measure and Public-key cryptography.
His Digital signature study combines topics in areas such as Signature, Lattice and Compact space.
The study incorporates disciplines such as Polynomial, Security parameter, Key encapsulation, Signature and Learning with errors in addition to Random oracle.
His work carried out in the field of Algebraic number field brings together such families of science as Lattice problem, Rank, Algorithm, Heuristic and Generalization.
Ring of integers is a subfield of Combinatorics that Damien Stehlé studies.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
