| 2009 |
| 23 | EE | Daniel J. Bernstein,
Tien-Ren Chen,
Chen-Mou Cheng,
Tanja Lange,
Bo-Yin Yang:
ECM on Graphics Cards.
EUROCRYPT 2009: 483-501 |
| 2008 |
| 22 | EE | Daniel J. Bernstein,
Peter Birkner,
Marc Joye,
Tanja Lange,
Christiane Peters:
Twisted Edwards Curves.
AFRICACRYPT 2008: 389-405 |
| 21 | EE | Daniel J. Bernstein,
Tanja Lange,
Reza Rezaeian Farashahi:
Binary Edwards Curves.
CHES 2008: 244-265 |
| 20 | EE | Daniel J. Bernstein:
Proving Tight Security for Rabin-Williams Signatures.
EUROCRYPT 2008: 70-87 |
| 19 | EE | Daniel J. Bernstein,
Peter Schwabe:
New AES Software Speed Records.
INDOCRYPT 2008: 322-336 |
| 18 | EE | Daniel J. Bernstein,
Tanja Lange,
Christiane Peters:
Attacking and Defending the McEliece Cryptosystem.
PQCrypto 2008: 31-46 |
| 2007 |
| 17 | EE | Daniel J. Bernstein,
Tanja Lange:
Inverted Edwards Coordinates.
AAECC 2007: 20-27 |
| 16 | EE | Daniel J. Bernstein:
The Tangent FFT.
AAECC 2007: 291-300 |
| 15 | EE | Daniel J. Bernstein,
Tanja Lange:
Faster Addition and Doubling on Elliptic Curves.
ASIACRYPT 2007: 29-50 |
| 14 | EE | Daniel J. Bernstein:
Some thoughts on security after ten years of qmail 1.0.
CSAW 2007: 1-10 |
| 13 | EE | Bo-Yin Yang,
Chia-Hsin Owen Chen,
Daniel J. Bernstein,
Jiun-Ming Chen:
Analysis of.
FSE 2007: 290-308 |
| 12 | EE | Daniel J. Bernstein,
Peter Birkner,
Tanja Lange,
Christiane Peters:
Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication.
INDOCRYPT 2007: 167-182 |
| 2006 |
| 11 | EE | Daniel J. Bernstein:
Curve25519: New Diffie-Hellman Speed Records.
Public Key Cryptography 2006: 207-228 |
| 2005 |
| 10 | EE | Daniel J. Bernstein:
Stronger Security Bounds for Wegman-Carter-Shoup Authenticators.
EUROCRYPT 2005: 164-180 |
| 9 | EE | Daniel J. Bernstein:
The Poly1305-AES Message-Authentication Code.
FSE 2005: 32-49 |
| 8 | EE | Daniel J. Bernstein:
Factoring into coprimes in essentially linear time.
J. Algorithms 54(1): 1-30 (2005) |
| 2004 |
| 7 | | A. O. L. Atkin,
Daniel J. Bernstein:
Prime sieves using binary quadratic forms.
Math. Comput. 73(246): 1023-1030 (2004) |
| 2001 |
| 6 | | Daniel J. Bernstein:
Enumerating solutions to p(a) + q(b) = r(c) + s(d).
Math. Comput. 70(233): 389-394 (2001) |
| 1999 |
| 5 | EE | Daniel J. Bernstein:
How to Stretch Random Functions: The Security of Protected Counter Sums.
J. Cryptology 12(3): 185-192 (1999) |
| 1998 |
| 4 | EE | Daniel J. Bernstein:
Bounding Smooth Integers.
ANTS 1998: 128-130 |
| 3 | | Daniel J. Bernstein:
Composing Power Series Over a Finite Ring in Essentially Linear Time.
J. Symb. Comput. 26(3): 339-341 (1998) |
| 2 | | Daniel J. Bernstein:
Detecting perfect powers in essentially linear time.
Math. Comput. 67(223): 1253-1283 (1998) |
| 1996 |
| 1 | | Daniel J. Bernstein:
Fast Ideal Artithmetic via Lazy Localization.
ANTS 1996: 27-34 |