2002 - Fellow of Alfred P. Sloan Foundation
His primary areas of investigation include Edwards curve, Elliptic curve, Discrete mathematics, Twisted Edwards curve and Cryptography. The Elliptic curve study combines topics in areas such as Computation, Karatsuba algorithm, Scalar and Public-key cryptography. The concepts of his Public-key cryptography study are interwoven with issues in Parallel computing, Security level and Arithmetic.
His study on Algebraic number field is often connected to Direct method as part of broader study in Discrete mathematics. Cryptography is a subfield of Computer security that Daniel J. Bernstein investigates. His study in Quantum computer extends to Computer security with its themes.
Daniel J. Bernstein mainly focuses on Elliptic curve, Cryptography, Discrete mathematics, Computer security and Edwards curve. His studies in Elliptic curve integrate themes in fields like Multiplication, Computation, Precomputation and Binary number. His Cryptography study incorporates themes from Parallel computing, Code, Simple, Embedded system and Public-key cryptography.
Daniel J. Bernstein focuses mostly in the field of Public-key cryptography, narrowing it down to matters related to Signature and, in some cases, Theoretical computer science. His work on Post-quantum cryptography, Hash function and Encryption as part of general Computer security research is frequently linked to NIST, thereby connecting diverse disciplines of science. His work carried out in the field of Edwards curve brings together such families of science as Software, Supersingular elliptic curve and Twisted Edwards curve.
The scientist’s investigation covers issues in Elliptic curve, Isogeny, Computation, Algorithm and Lattice. His Elliptic curve study frequently links to related topics such as Cryptanalysis. His Cryptanalysis research incorporates themes from Quantum computer, Mathematical analysis and Binary number.
His Computation research is multidisciplinary, incorporating elements of Key generation, Cryptosystem, Curve25519, Polynomial and Greatest common divisor. Daniel J. Bernstein focuses mostly in the field of Algorithm, narrowing it down to topics relating to Signature and, in certain cases, Theoretical computer science and Concrete security. His Encryption study contributes to a more complete understanding of Computer security.
His primary scientific interests are in Elliptic curve, Isogeny, Post-quantum cryptography, Computation and Algorithm. His Elliptic curve research integrates issues from Quantum computer, Cryptanalysis and Quotient, Combinatorics. His work blends Isogeny and Prime degree studies together.
Post-quantum cryptography is the subject of his research, which falls under Encryption. His studies deal with areas such as Fermat's Last Theorem, Cryptosystem, Curve25519, Polynomial and Greatest common divisor as well as Computation. His Algorithm study combines topics in areas such as Integer and Integer.
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.
Introduction to post-quantum cryptography
DJ Daniel Bernstein.
Post Quantum Cryptography (2009)
Curve25519: new diffie-hellman speed records
Daniel J. Bernstein.
public key cryptography (2006)
Post Quantum Cryptography
Daniel J. Bernstein;Johannes Buchmann;Erik Dahmen.
Nature (2008)
Faster addition and doubling on elliptic curves
Daniel J. Bernstein;Tanja Lange.
international conference on the theory and application of cryptology and information security (2007)
High-speed high-security signatures
DJ Daniel Bernstein;N Niels Duif;T Tanja Lange;P Peter Schwabe.
Journal of Cryptographic Engineering (2012)
The Salsa20 Family of Stream Ciphers
Daniel J. Bernstein.
New Stream Cipher Designs (2008)
Twisted Edwards curves
Daniel J. Bernstein;Peter Birkner;Marc Joye;Tanja Lange.
international conference on progress in cryptology (2008)
Attacking and defending the McEliece cryptosystem
Daniel J. Bernstein;Tanja Lange;Christiane Peters.
IACR Cryptology ePrint Archive (2008)
The Poly1305-AES message-authentication code
Daniel J. Bernstein.
fast software encryption (2005)
SipHash : a fast short-input PRF
Jean Philippe Aumasson;Daniel J. Bernstein.
international conference on cryptology in india (2012)
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:
Eindhoven University of Technology
Radboud University Nijmegen
National Taiwan University
University of Waterloo
Max Planck Institute for Security and Privacy
Ruhr University Bochum
University of California, San Diego
Radboud University Nijmegen
University of Michigan–Ann Arbor
ETH Zurich
University of Freiburg
Monash University
Tencent (China)
Aristotle University of Thessaloniki
University of Maryland, College Park
University of Münster
Pennsylvania State University
Ludwig-Maximilians-Universität München
National Institutes of Health
University of Michigan–Ann Arbor
Seattle Children's Hospital
University of Amsterdam
Washington University in St. Louis
Maastricht University
Rutgers, The State University of New Jersey
California Institute of Technology