Daniel J. Bernstein

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

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

2019
Fast constant-time gcd computation and modular inversion.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2019

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

Decisional second-preimage resistance: When does SPR imply PRE?
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

McTiny: fast high-confidence post-quantum key erasure for tiny network servers.
IACR Cryptol. ePrint Arch., 2019

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

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

Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies.
IACR Cryptol. ePrint Arch., 2018

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

2017
Post-quantum cryptography.
Nat., 2017

Asymptotically faster quantum algorithms to solve multivariate quadratic equations.
IACR Cryptol. ePrint Arch., 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

Gimli: a cross-platform permutation.
IACR Cryptol. ePrint Arch., 2017

Post-quantum RSA.
IACR Cryptol. ePrint Arch., 2017

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

A low-resource quantum factoring algorithm.
IACR Cryptol. ePrint Arch., 2017

Sliding right into disaster: Left-to-right sliding windows leak.
IACR Cryptol. ePrint Arch., 2017

HILA5 Pindakaas: On the CCA security of lattice-based encryption with error correction.
IACR Cryptol. ePrint Arch., 2017

Short generators without quantum computers: the case of multiquadratics.
IACR Cryptol. ePrint Arch., 2017

Low-communication parallel quantum multi-target preimage search.
IACR Cryptol. ePrint Arch., 2017

NTRU Prime: Reducing Attack Surface at Low Cost.
Proceedings of the Selected Areas in Cryptography - SAC 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.
IACR Cryptol. ePrint Arch., 2016

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

Dual EC: A Standardized Back Door.
IACR Cryptol. ePrint Arch., 2015

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

Bad directions in cryptographic hash functions.
IACR Cryptol. ePrint Arch., 2015

McBits: fast constant-time code-based cryptography.
IACR Cryptol. ePrint Arch., 2015

Twisted Hessian curves.
IACR Cryptol. ePrint Arch., 2015

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

Investigating SRAM PUFs in large CPUs and GPUs.
IACR Cryptol. ePrint Arch., 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

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

2014
Batch NFS.
IACR Cryptol. ePrint Arch., 2014

Hyper-and-elliptic-curve cryptography.
IACR Cryptol. ePrint Arch., 2014

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

Kummer strikes back: new DH speed records.
IACR Cryptol. ePrint Arch., 2014

Curve41417: Karatsuba revisited.
IACR Cryptol. ePrint Arch., 2014

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

Faster Binary-Field Multiplication and Faster Binary-Field MACs.
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

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

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

MinimaLT: Minimal-latency Networking Through Better Security.
IACR Cryptol. ePrint Arch., 2013

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

Quantum algorithms for the subset-sum problem.
IACR Cryptol. ePrint Arch., 2013

Factoring RSA keys from certified smart cards: Coppersmith in the wild.
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

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

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

2012
High-speed high-security signatures.
J. Cryptogr. Eng., 2012

Computing small discrete logarithms faster.
IACR Cryptol. ePrint Arch., 2012

Never trust a bunny.
IACR Cryptol. ePrint Arch., 2012

Non-uniform cracks in the concrete: the power of free precomputation.
IACR Cryptol. ePrint Arch., 2012

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

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

Faster batch forgery identification.
IACR Cryptol. ePrint Arch., 2012

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

ECC2K-130 on NVIDIA GPUs.
IACR Cryptol. ePrint Arch., 2012

SipHash: a fast short-input PRF.
IACR Cryptol. ePrint Arch., 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

The security impact of a new cryptographic library.
IACR Cryptol. ePrint Arch., 2011

On the correct use of the negation map in the Pollard rho method.
IACR Cryptol. ePrint Arch., 2011

Faster 2-regular information-set decoding.
IACR Cryptol. ePrint Arch., 2011

Really fast syndrome-based hashing.
IACR Cryptol. ePrint Arch., 2011

Wild McEliece Incognito.
IACR Cryptol. ePrint Arch., 2011

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

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

2010
Smaller decoding exponents: ball-collision decoding.
IACR Cryptol. ePrint Arch., 2010

Wild McEliece.
IACR Cryptol. ePrint Arch., 2010

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

Type-II Optimal Polynomial Bases.
IACR Cryptol. ePrint Arch., 2010

Starfish on Strike.
IACR Cryptol. ePrint Arch., 2010

Grover vs. McEliece.
Proceedings of the Post-Quantum Cryptography, Third International Workshop, 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

FSBday.
Proceedings of the Progress 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

New AES software speed records.
IACR Cryptol. ePrint Arch., 2008

Attacking and defending the McEliece cryptosystem.
IACR Cryptol. ePrint Arch., 2008

Binary Edwards Curves.
IACR Cryptol. ePrint Arch., 2008

ECM on Graphics Cards.
IACR Cryptol. ePrint Arch., 2008

Twisted Edwards Curves.
IACR Cryptol. ePrint Arch., 2008

Proving Tight Security for Rabin-Williams Signatures.
Proceedings of the Advances 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

Inverted Edwards coordinates.
IACR Cryptol. ePrint Arch., 2007

Faster addition and doubling on elliptic curves.
IACR Cryptol. ePrint Arch., 2007

Optimizing double-base elliptic-curve single-scalar multiplication.
IACR Cryptol. ePrint Arch., 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

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. Cryptology, 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...