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 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.
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.
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.
Handbook of Floating-Point Arithmetic
Jean-Michel Muller;Nicolas Brisebarre;Florent de Dinechin;Claude-Pierre Jeannerod.
Classical hardness of learning with errors
Zvika Brakerski;Adeline Langlois;Chris Peikert;Oded Regev.
symposium on the theory of computing (2013)
Making NTRU as secure as worst-case problems over ideal lattices
Damien Stehlé;Ron Steinfeld.
international cryptology conference (2011)
Faster Fully Homomorphic Encryption
Damien Noel Stehle;Ron Steinfeld.
international conference on the theory and application of cryptology and information security (2010)
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
Joppe Bos;Leo Ducas;Eike Kiltz;T Lepoint.
ieee european symposium on security and privacy (2018)
Cryptanalysis of the Multilinear Map over the Integers
Jung Hee Cheon;Kyoohyung Han;Changmin Lee;Hansol Ryu.
theory and application of cryptographic techniques (2015)
Worst-case to average-case reductions for module lattices
Adeline Langlois;Damien Stehlé.
Designs, Codes and Cryptography (2015)
Floating-Point LLL revisited
Phong Q. Nguên;Damien Stehlé.
theory and application of cryptographic techniques (2005)
CRYSTALS-Dilithium: A lattice-based digital signature scheme
Léo Ducas;Eike Kiltz;Tancrède Lepoint;Vadim Lyubashevsky.
cryptographic hardware and embedded systems (2018)
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
Shweta Agrawal;Benoît Libert;Damien Stehlé.
international cryptology conference (2016)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: