Daniel J. Bernstein

Affiliations:
  • University of Illinois at Chicago, Department of Computer Science
  • TU Eindhoven, Department of Mathematics and Computer Science


According to our database1, Daniel J. Bernstein authored at least 144 papers between 1990 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
PQConnect: Automated Post-Quantum End-to-End Tunnels.
Proceedings of the 32nd Annual Network and Distributed System Security Symposium, 2025

Safe curves for elliptic-curve cryptography.
Proceedings of the Information Security in a Connected World, 2025

2024
Searching for differential addition chains.
IACR Cryptol. ePrint Arch., 2024

Report on evaluation of KpqC Round-2 candidates.
IACR Cryptol. ePrint Arch., 2024

KyberSlash: Exploiting secret-dependent division timings in Kyber implementations.
IACR Cryptol. ePrint Arch., 2024

Asymptotics for the standard block size in primal lattice attacks: second order, formally verified.
IACR Cryptol. ePrint Arch., 2024

Understanding binary-Goppa decoding.
IACR Commun. Cryptol., 2024

CryptAttackTester: high-assurance attack analysis.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
CryptAttackTester: formalizing attack analyses.
IACR Cryptol. ePrint Arch., 2023

Analyzing the complexity of reference post-quantum software.
IACR Cryptol. ePrint Arch., 2023

Asymptotics of hybrid primal lattice attacks.
IACR Cryptol. ePrint Arch., 2023

Predicting performance for post-quantum encrypted-file systems.
IACR Cryptol. ePrint Arch., 2023

Quantifying risks in cryptographic selection processes.
IACR Cryptol. ePrint Arch., 2023

2022
Multi-ciphertext security degradation for lattices.
IACR Cryptol. ePrint Arch., 2022

Fast norm computation in smooth-degree Abelian number fields.
IACR Cryptol. ePrint Arch., 2022

OpenSSLNTRU: Faster post-quantum TLS key exchange.
Proceedings of the 31st USENIX Security Symposium, 2022

A One-Time Single-bit Fault Leaks All Previous NTRU-HRSS Session Keys to a Chosen-Ciphertext Attack.
Proceedings of the Progress in Cryptology - INDOCRYPT 2022, 2022

2021
Non-randomness of S-unit lattices.
IACR Cryptol. ePrint Arch., 2021

On the looseness of FO derandomization.
IACR Cryptol. ePrint Arch., 2021

CTIDH: faster constant-time CSIDH.
IACR Cryptol. ePrint Arch., 2021

BasicBlocker: ISA Redesign to Make Spectre-Immune CPUs Faster.
Proceedings of the RAID '21: 24th International Symposium on Research in Attacks, 2021

2020
Observations on COMET.
IACR Cryptol. ePrint Arch., 2020

Faster computation of isogenies of large prime degree.
IACR Cryptol. ePrint Arch., 2020

Cryptographic competitions.
IACR Cryptol. ePrint Arch., 2020

Verified fast formulas for control bits for permutation networks.
IACR Cryptol. ePrint Arch., 2020

A discretization attack.
IACR Cryptol. ePrint Arch., 2020

Concrete quantum cryptanalysis of binary elliptic curves.
IACR Cryptol. ePrint Arch., 2020

BasicBlocker: Redesigning ISAs to Eliminate Speculative-Execution Attacks.
CoRR, 2020

McTiny: Fast High-Confidence Post-Quantum Key Erasure for Tiny Network Servers.
Proceedings of the 29th USENIX Security Symposium, 2020

2019
Fast constant-time gcd computation and modular inversion.
IACR Cryptol. ePrint Arch., 2019

The SPHINCS+ Signature Framework.
IACR Cryptol. ePrint Arch., 2019

Comparing proofs of security for lattice-based encryption.
IACR Cryptol. ePrint Arch., 2019

Visualizing size-security tradeoffs for lattice-based encryption.
IACR Cryptol. ePrint Arch., 2019

Quantum Circuits for the CSIDH: Optimizing Quantum Evaluation of Isogenies.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

The SPHINCS<sup>+</sup> Signature Framework.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

Decisional Second-Preimage Resistance: When Does SPR Imply PRE?
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
Towards KEM Unification.
IACR Cryptol. ePrint Arch., 2018

Is the security of quantum cryptography guaranteed by the laws of physics?
CoRR, 2018

Asymptotically Faster Quantum Algorithms to Solve Multivariate Quadratic Equations.
Proceedings of the Post-Quantum Cryptography - 9th International Conference, 2018

HILA5 Pindakaas: On the CCA Security of Lattice-Based Encryption with Error Correction.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2018, 2018

2017
Post-quantum cryptography.
Nat., 2017

Post-quantum cryptography - dealing with the fallout of physics success.
IACR Cryptol. ePrint Arch., 2017

Montgomery curves and the Montgomery ladder.
IACR Cryptol. ePrint Arch., 2017

Double-base scalar multiplication revisited.
IACR Cryptol. ePrint Arch., 2017

NTRU Prime: Reducing Attack Surface at Low Cost.
Proceedings of the Selected Areas in Cryptography - SAC 2017, 2017

Low-Communication Parallel Quantum Multi-Target Preimage Search.
Proceedings of the Selected Areas in Cryptography - SAC 2017, 2017

Post-quantum RSA.
Proceedings of the Post-Quantum Cryptography - 8th International Workshop, 2017

A Low-Resource Quantum Factoring Algorithm.
Proceedings of the Post-Quantum Cryptography - 8th International Workshop, 2017

Short Generators Without Quantum Computers: The Case of Multiquadratics.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Gimli : A Cross-Platform Permutation.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2017, 2017

Sliding Right into Disaster: Left-to-Right Sliding Windows Leak.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2017, 2017

2016
Faster discrete logarithms on FPGAs.
IACR Cryptol. ePrint Arch., 2016

NTRU Prime.
IACR Cryptol. ePrint Arch., 2016

Hash-Function Based PRFs: AMAC and Its Multi-User Security.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Dual EC: A Standardized Back Door.
Proceedings of the New Codebreakers, 2016

2015
Tighter, faster, simpler side-channel security evaluations beyond computing power.
IACR Cryptol. ePrint Arch., 2015

EdDSA for more curves.
IACR Cryptol. ePrint Arch., 2015

Multi-user Schnorr security, revisited.
IACR Cryptol. ePrint Arch., 2015

Investigating SRAM PUFs in large CPUs and GPUs.
Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2015

How to Manipulate Curve Standards: A White Paper for the Black Hat http: //bada55.cr.yp.to.
Proceedings of the Security Standardisation Research - Second International Conference, 2015

Twisted Hessian Curves.
Proceedings of the Progress in Cryptology - LATINCRYPT 2015, 2015

SPHINCS: Practical Stateless Hash-Based Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Bad Directions in Cryptographic Hash Functions.
Proceedings of the Information Security and Privacy - 20th Australasian Conference, 2015

2014
Hyper-and-elliptic-curve cryptography.
LMS J. Comput. Math., 2014

SPHINCS: practical stateless hash-based signatures.
IACR Cryptol. ePrint Arch., 2014

How to manipulate curve standards: a white paper for the black hat.
IACR Cryptol. ePrint Arch., 2014

On the Practical Exploitability of Dual EC in TLS Implementations.
Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22, 2014., 2014

Batch NFS.
Proceedings of the Selected Areas in Cryptography - SAC 2014, 2014

Faster Binary-Field Multiplication and Faster Binary-Field MACs.
Proceedings of the Selected Areas in Cryptography - SAC 2014, 2014

TweetNaCl: A Crypto Library in 100 Tweets.
Proceedings of the Progress in Cryptology - LATINCRYPT 2014, 2014

Curve41417: Karatsuba Revisited.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2014, 2014

Kummer Strikes Back: New DH Speed Records.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
ECM using Edwards curves.
Math. Comput., 2013

Elligator: Elliptic-curve points indistinguishable from uniform random strings.
IACR Cryptol. ePrint Arch., 2013

On the Security of RC4 in TLS.
Proceedings of the 22th USENIX Security Symposium, Washington, DC, USA, August 14-16, 2013, 2013

Quantum Algorithms for the Subset-Sum Problem.
Proceedings of the Post-Quantum Cryptography - 5th International Workshop, 2013

McBits: Fast Constant-Time Code-Based Cryptography.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2013, 2013

MinimaLT: minimal-latency networking through better security.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

Elligator: elliptic-curve points indistinguishable from uniform random strings.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

Non-uniform Cracks in the Concrete: The Power of Free Precomputation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

Addition formulas for elliptic curves.
Proceedings of the Handbook of Finite Fields., 2013

2012
Two grumpy giants and a baby.
IACR Cryptol. ePrint Arch., 2012

The new SHA-3 software shootout.
IACR Cryptol. ePrint Arch., 2012

Usable assembly language for GPUs: a success story.
IACR Cryptol. ePrint Arch., 2012

Never Trust a Bunny.
Proceedings of the Radio Frequency Identification. Security and Privacy Issues, 2012

The Security Impact of a New Cryptographic Library.
Proceedings of the Progress in Cryptology - LATINCRYPT 2012, 2012

Computing Small Discrete Logarithms Faster.
Proceedings of the Progress in Cryptology, 2012

Faster Batch Forgery Identification.
Proceedings of the Progress in Cryptology, 2012

SipHash: A Fast Short-Input PRF.
Proceedings of the Progress in Cryptology, 2012

NEON Crypto.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2012, 2012

2011
Post-Quantum Cryptography.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Factorization Circuits.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Wild McEliece Incognito.
Proceedings of the Post-Quantum Cryptography - 4th International Workshop, 2011

Simplified High-Speed High-Distance List Decoding for Alternant Codes.
Proceedings of the Post-Quantum Cryptography - 4th International Workshop, 2011

On the Correct Use of the Negation Map in the Pollard rho Method.
Proceedings of the Public Key Cryptography - PKC 2011, 2011

Smaller Decoding Exponents: Ball-Collision Decoding.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Faster 2-Regular Information-Set Decoding.
Proceedings of the Coding and Cryptology - Third International Workshop, 2011

List Decoding for Binary Goppa Codes.
Proceedings of the Coding and Cryptology - Third International Workshop, 2011

High-Speed High-Security Signatures.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2011 - 13th International Workshop, Nara, Japan, September 28, 2011

Really Fast Syndrome-Based Hashing.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2011, 2011

2010
Cryptanalysis of Skein.
IACR Cryptol. ePrint Arch., 2010

Type-II Optimal Polynomial Bases.
Proceedings of the Arithmetic of Finite Fields, Third International Workshop, 2010

Wild McEliece.
Proceedings of the Selected Areas in Cryptography - 17th International Workshop, 2010

Grover vs. McEliece.
Proceedings of the Post-Quantum Cryptography, Third International Workshop, 2010

Starfish on Strike.
Proceedings of the Progress in Cryptology, 2010

ECC2K-130 on NVIDIA GPUs.
Proceedings of the Progress in Cryptology - INDOCRYPT 2010, 2010

2009
Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB.
IACR Cryptol. ePrint Arch., 2009

A complete set of addition laws for incomplete Edwards curves.
IACR Cryptol. ePrint Arch., 2009

Breaking ECC2K-130.
IACR Cryptol. ePrint Arch., 2009

The Certicom Challenges ECC2-X.
IACR Cryptol. ePrint Arch., 2009

Breaking DNSSEC.
Proceedings of the 3rd USENIX Workshop on Offensive Technologies, 2009

Using Compilers to Enhance Cryptographic Product Development.
Proceedings of the ISSE 2009, 2009

FSBday.
Proceedings of the Progress in Cryptology, 2009

ECM on Graphics Cards.
Proceedings of the Advances in Cryptology, 2009

Batch Binary Edwards.
Proceedings of the Advances in Cryptology, 2009

2008
The Salsa20 Family of Stream Ciphers.
Proceedings of the New Stream Cipher Designs - The eSTREAM Finalists, 2008

Attacking and Defending the McEliece Cryptosystem.
Proceedings of the Post-Quantum Cryptography, Second International Workshop, 2008

New AES Software Speed Records.
Proceedings of the Progress in Cryptology, 2008

Proving Tight Security for Rabin-Williams Signatures.
Proceedings of the Advances in Cryptology, 2008

Binary Edwards Curves.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2008

Twisted Edwards Curves.
Proceedings of the Progress in Cryptology, 2008

2007
Modular exponentiation via the explicit Chinese remainder theorem.
Math. Comput., 2007

Detecting perfect powers by factoring into coprimes.
Math. Comput., 2007

Proving primality in essentially quartic random time.
Math. Comput., 2007

Analysis and optimization of elliptic-curve single-scalar multiplication.
IACR Cryptol. ePrint Arch., 2007

Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication.
Proceedings of the Progress in Cryptology, 2007

Analysis of QUAD
Proceedings of the Fast Software Encryption, 14th International Workshop, 2007

Some thoughts on security after ten years of qmail 1.0.
Proceedings of the 2007 ACM workshop on Computer Security Architecture, 2007

Faster Addition and Doubling on Elliptic Curves.
Proceedings of the Advances in Cryptology, 2007

Inverted Edwards Coordinates.
Proceedings of the Applied Algebra, 2007

The Tangent FFT.
Proceedings of the Applied Algebra, 2007

2006
Curve25519: New Diffie-Hellman Speed Records.
Proceedings of the Public Key Cryptography, 2006

2005
Factoring into coprimes in essentially linear time.
J. Algorithms, 2005

The Poly1305-AES Message-Authentication Code.
Proceedings of the Fast Software Encryption: 12th International Workshop, 2005

Stronger Security Bounds for Wegman-Carter-Shoup Authenticators.
Proceedings of the Advances in Cryptology, 2005

2004
Prime sieves using binary quadratic forms.
Math. Comput., 2004

2001
Enumerating solutions to p(a) + q(b) = r(c) + s(d).
Math. Comput., 2001

1999
How to Stretch Random Functions: The Security of Protected Counter Sums.
J. Cryptol., 1999

1998
Detecting perfect powers in essentially linear time.
Math. Comput., 1998

Composing Power Series Over a Finite Ring in Essentially Linear Time.
J. Symb. Comput., 1998

Bounding Smooth Integers.
Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1996
Fast Ideal Artithmetic via Lazy Localization.
Proceedings of the Algorithmic Number Theory, Second International Symposium, 1996

1990
The Q Method of Implementing TELNET Option Negotiation.
RFC, February, 1990


  Loading...