D. J. Bernstein

Index of formal scientific papers

Papers by title

zeroseek A fast journaling filesystem
nfsi A general number field sieve implementation
231 A non-iterative 2-adic statement of the 3N+1 conjecture
sigs A secure public-key signature system with extremely fast verification
easycbc A short proof of the unpredictability of cipher block chaining
unipat A simple universal pattern-matching automaton
psi Arbitrarily tight bounds on the distribution of smooth integers
psi-abs Bounding smooth integers (extended abstract)
cachetiming Cache-timing attacks on AES
calculus Calculus for mathematicians
curvezero Can we avoid tests for zero in fast elliptic-curve arithmetic?
nfscircuit Circuits for integer factorization: a proposal
rings Commutative rings
stream256 Comparison of 256-bit stream ciphers at the beginning of 2006
compose Composing power series over a finite ring in essentially linear time
logfloor Computing logarithm floors in essentially linear time
logagm Computing logarithm intervals with the arithmetic-geometric-mean iteration
nfspoly Controlling three coefficients in number-field-sieve polynomials
curve25519 Curve25519: new Diffie-Hellman speed records
decompress Data decompression
powers2 Detecting perfect powers by factoring into coprimes
powers Detecting perfect powers in essentially linear time
diffchain Differential addition chains
prime2004 Distinguishing prime numbers from composite numbers: the state of the art in 2004
zkcrypt Does ZK-Crypt version 1 flunk a repetition test?
focus Doubly focused enumeration of locally square polynomial values
epsi Enumerating and counting smooth integers
sortedsums Enumerating solutions to p(a)+q(b)=r(c)+s(d)
smoothdep Estimating the dependence time for smooth integers
dcba Factoring into coprimes in essentially linear time
fiall Fast ideal arithmetic via lazy localization
multapps Fast multiplication and its applications
nistp224 Fast point multiplication on the NIST P-224 elliptic curve
nonsquare Faster algorithms to find non-squares modulo worst-case integers
dcba2 Faster factorization into coprimes
zmult Faster multiplication of integers
sqroot Faster square roots in annoying finite fields
hash127 Floating-point arithmetic and message authentication
gge Generalized Gaussian elimination
hash127-abs Guaranteed message authentication faster than MD5 (abstract)
fastgraeffe High-precision roots of high-degree polynomials
sf How to find small factors of integers
smoothparts How to find smooth parts of integers
stretch How to stretch random functions: the security of protected counter sums
fastgcd Kronecker matrices and polynomial GCDs
mimd Matrix inversion made difficult
meecrt Modular exponentiation via the explicit Chinese remainder theorem
mmecrt Multidigit modular multiplication with the Explicit Chinese Remainder Theorem
m3 Multidigit multiplication for mathematicians
westinghouse New fast algorithms for pi and e
pippenger Pippenger's exponentiation algorithm
hblcs Predicting a linear congruential sequence from its high bits
primesieves Prime sieves using binary quadratic forms
forgery Protecting communications against forgery
aks Proving primality after Agrawal-Kayal-Saxena
quartic Proving primality in essentially quartic random time
rwtight Proving tight security for standard Rabin-Williams signatures
smallheight Reducing lattice bases to find small-height values of univariate polynomials
fastnewton Removing redundancy in high-precision Newton iteration
huptrie Saving space and time in hash tries
scaledmod Scaled remainder trees
abccong Sharper ABC-based bounds for congruent polynomials
permutations Stronger security bounds for permutations
securitywcs Stronger security bounds for Wegman-Carter-Shoup authenticators
senfs Superelliptic integrals and the number-field sieve
surf SURF: Simple Unpredictable Random Function
3x1conjmap The 3x+1 conjugacy map
abc The ABC polygon
c3 The complexity of complex convolution
mlnfs The multiple-lattice number field sieve
poly1305 The Poly1305-AES message-authentication code
dal The ubiquitous dal function
bruteforce Understanding brute force

Papers by date

Sorted by date of the most recently published version. When another date is listed, it is the date of the first published version.

URL Pages First published version Refereed? Printed? Most recently published version

http://cr.yp.to/papers.html#westinghouse 21pp 1987 [scanned] [more]
DJB. ``New fast algorithms for pi and e.'' Paper for the Westinghouse competition, distributed widely at the Ramanujan Centenary Conference.
http://cr.yp.to/papers.html#nfsi 24pp printed 1993.01 [more]
DJB, Arjen K. Lenstra. ``A general number field sieve implementation.'' Pages 103-126 in The development of the number field sieve, edited by Arjen K. Lenstra, Hendrik W. Lenstra, Jr.; 3-540-57013-6, Lecture Notes in Mathematics 1554, Springer.
http://cr.yp.to/papers.html#231 4pp refereed printed 1994.02 [more]
DJB. ``A non-iterative 2-adic statement of the 3N+1 conjecture.'' Proceedings of the American Mathematical Society 121, 405-408.
http://cr.yp.to/papers.html#epsi 4pp printed 1995.05 [PDF] [more]
DJB. ``Enumerating and counting smooth integers.'' Chapter 2, Ph.D. thesis, University of California at Berkeley.
http://cr.yp.to/papers.html#mlnfs 5pp printed 1995.05 [PDF] [more]
DJB. ``The multiple-lattice number field sieve.'' Chapter 3, Ph.D. thesis, University of California at Berkeley.
http://cr.yp.to/papers.html#mmecrt 7pp printed 1995.05 [PDF] [more]
DJB. ``Multidigit modular multiplication with the Explicit Chinese Remainder Theorem.'' Chapter 4, Ph.D. thesis, University of California at Berkeley.
http://cr.yp.to/papers.html#fiall 8pp refereed printed 1996.06.01 [PDF] [more]
DJB. ``Fast ideal arithmetic via lazy localization.'' Pages 27-34 in Proceedings of the Algorithmic Number Theory Symposium II, edited by Henri Cohen; 3-540-61581-4, Lecture Notes in Computer Science 1122, Springer.
http://cr.yp.to/papers.html#fastgcd 1996.06.28 [more]
DJB. ``Kronecker matrices and polynomial GCDs.'' Superseded by multapps.
http://cr.yp.to/papers.html#3x1conjmap 16pp refereed printed 1996.11 [more]
DJB, Jeffrey C. Lagarias. ``The 3x+1 conjugacy map.'' Canadian Journal of Mathematics 48, 1154-1169.
http://cr.yp.to/papers.html#calculus 12pp 1997.04.03 [PDF] [more]
DJB. ``Calculus for mathematicians.''
http://cr.yp.to/papers.html#psi-abs 3pp refereed printed 1998.07.01 [PDF] [more]
DJB. ``Bounding smooth integers (extended abstract).'' Pages 128-130 in Proceedings of the Algorithmic Number Theory Symposium III, edited by Joe Buhler; 3-540-64657-4, Lecture Notes in Computer Science 1423, Springer.
http://cr.yp.to/papers.html#powers 31pp 1995.05 refereed printed 1998.07 [PDF] [more]
DJB. ``Detecting perfect powers in essentially linear time.'' Mathematics of Computation 67, 1253-1283.
http://cr.yp.to/papers.html#compose 3pp refereed printed 1998.09 [PDF] [more]
DJB. ``Composing power series over a finite ring in essentially linear time.'' Journal of Symbolic Computation 26, 339-341.
http://cr.yp.to/papers.html#stretch 8pp refereed printed 1999 [PDF] [more]
DJB. ``How to stretch random functions: the security of protected counter sums.'' Journal of Cryptology 12, 185-192.
http://cr.yp.to/papers.html#hash127-abs 2pp 1999.04.04 [PDF] [more]
DJB. ``Guaranteed message authentication faster than MD5 (abstract).''
http://cr.yp.to/papers.html#unipat 6pp 2000.08.06 [PDF] [more]
DJB. ``A simple universal pattern-matching automaton.''
http://cr.yp.to/papers.html#sigs 11pp refereed 2000.08.09 [PDF] [more]
DJB. ``A secure public-key signature system with extremely fast verification.'' Accepted to Journal of Cryptology, but withdrawn to be incorporated into author's High-speed cryptography book.
http://cr.yp.to/papers.html#sortedsums 6pp 1998.06.29 refereed printed 2001.01 [PDF] [more]
DJB. ``Enumerating solutions to p(a)+q(b)=r(c)+s(d).'' Mathematics of Computation 70, 389-394.
http://cr.yp.to/papers.html#m3 19pp refereed 2001.08.11 [PDF] [more]
DJB. ``Multidigit multiplication for mathematicians.'' Accepted to Advances in Applied Mathematics, but withdrawn because of incompetent printer.
http://cr.yp.to/papers.html#nfscircuit 11pp 2001.11.09 [PDF] [more]
DJB. ``Circuits for integer factorization: a proposal.'' Excerpted from DMS-0140542 grant proposal.
http://cr.yp.to/papers.html#sqroot 10pp 2001.11.23 [PDF] [more]
DJB. ``Faster square roots in annoying finite fields.'' To be incorporated into author's High-speed cryptography book.
http://cr.yp.to/papers.html#nonsquare 3pp 2001.12.20 [PDF] [more]
DJB. ``Faster algorithms to find non-squares modulo worst-case integers.''
http://cr.yp.to/papers.html#pippenger 21pp 2001.12.18 2002.01.18 [PDF] [more]
DJB. ``Pippenger's exponentiation algorithm.'' To be incorporated into author's High-speed cryptography book.
http://cr.yp.to/papers.html#sf 15pp 2000.06.22 2002.09.23 [PDF] [more]
DJB. ``How to find small factors of integers.'' Now being revamped in light of smoothparts results.
http://cr.yp.to/papers.html#psi 18pp 2000.11.03 refereed printed 2002.10.01 [PDF] [more]
DJB. ``Arbitrarily tight bounds on the distribution of smooth integers.'' Pages 49-66 in Number theory for the Millennium I, edited by Michael A. Bennett, Bruce C. Berndt, Nigel Boston, Harold G. Diamond, Adolf J. Hildebrand, Walter Philipp; 1-56881-146-2, A. K. Peters.
http://cr.yp.to/papers.html#aks 15pp 2002.08.09 2003.01.25 [PDF] [more]
DJB. ``Proving primality after Agrawal-Kayal-Saxena.''
http://cr.yp.to/papers.html#logfloor 4pp 2003.06.29 2003.06.30 [PDF] [more]
DJB. ``Computing logarithm floors in essentially linear time.''
http://cr.yp.to/papers.html#logagm 8pp 2003.07.17 2003.07.17 [PDF] [more]
DJB. ``Computing logarithm intervals with the arithmetic-geometric-mean iteration.''
http://cr.yp.to/papers.html#rwtight 13pp 2003.09.26 2003.09.26 [PDF] [more]
DJB. ``Proving tight security for standard Rabin-Williams signatures.'' To be incorporated into author's High-speed cryptography book.
http://cr.yp.to/papers.html#fastnewton 13pp 1998.06.27 2004.03.09 [PDF] [more]
DJB. ``Removing redundancy in high-precision Newton iteration.''
http://cr.yp.to/papers.html#primesieves 8pp 1999.05.05 refereed printed 2004.04 [PDF] [more]
A. O. L. Atkin, DJB. ``Prime sieves using binary quadratic forms.'' Mathematics of Computation 73, 1023-1030.
http://cr.yp.to/papers.html#smoothparts 7pp 2004.05.10 2004.05.10 [PDF] [more]
DJB. ``How to find smooth parts of integers.''
http://cr.yp.to/papers.html#focus 8pp 2001.12.31 refereed printed 2004.06.10 [more]
DJB. ``Doubly focused enumeration of locally square polynomial values.'' Pages 69--76 in High primes and misdemeanours, edited by Alf van der Poorten, Andreas Stein; 0-8218-3353-7, American Mathematical Society.
http://cr.yp.to/papers.html#scaledmod 8pp 2004.08.20 2004.08.20 [PDF] [more]
DJB. ``Scaled remainder trees.''
http://cr.yp.to/papers.html#forgery 10pp 2001.07.31 refereed 2004.09.06 [PDF] [more]
DJB. ``Protecting communications against forgery.'' To be printed in Algorithmic number theory, edited by Joe Buhler, Peter Stevenhagen.
http://cr.yp.to/papers.html#hash127 21pp 1999.04.04 2004.09.18 [PDF] [more]
DJB. ``Floating-point arithmetic and message authentication.'' To be incorporated into author's High-speed cryptography book.
http://cr.yp.to/papers.html#multapps 47pp 2003.01.19 refereed 2004.10.07 [PDF] [more]
DJB. ``Fast multiplication and its applications.'' To be printed in Algorithmic number theory, edited by Joe Buhler, Peter Stevenhagen.
http://cr.yp.to/papers.html#dcba2 4pp 2004.10.09 2004.11.03 [PDF] [more]
DJB. ``Research announcement: Faster factorization into coprimes.''
http://cr.yp.to/papers.html#quartic 15pp 2003.01.28 refereed 2004.12.03 [PDF] [more]
DJB. ``Proving primality in essentially quartic random time.'' To be printed in Mathematics of Computation.
http://cr.yp.to/papers.html#prime2004 15pp 2004.02.12 2004.12.23 [PDF] [more]
DJB. ``Distinguishing prime numbers from composite numbers: the state of the art in 2004.''
http://cr.yp.to/papers.html#dcba 30pp 1996.05.12 refereed printed 2005.01 [PDF] [more]
DJB. ``Factoring into coprimes in essentially linear time.'' Journal of Algorithms 54, 1-30.
http://cr.yp.to/papers.html#easycbc 6pp 2005.01.09 2005.01.09 [PDF] [more]
DJB. ``A short proof of the unpredictability of cipher block chaining.''
http://cr.yp.to/papers.html#securitywcs 17pp 2004.10.19 refereed printed 2005.02.27 [PDF] [more]
DJB. ``Stronger security bounds for Wegman-Carter-Shoup authenticators.'' Pages 164-180 in Advances in Cryptology: EUROCRYPT 2005, edited by Ronald Cramer; Springer.
http://cr.yp.to/papers.html#permutations 10pp 2005.03.23 2005.03.23 [PDF] [more]
DJB. ``Stronger security bounds for permutations.'' To be incorporated into author's High-speed cryptography book.
http://cr.yp.to/papers.html#poly1305 18pp 2004.11.01 refereed 2005.03.29 [PDF] [more]
DJB. ``The Poly1305-AES message-authentication code.'' To be printed in Proceedings of FSE 2005.
http://cr.yp.to/papers.html#cachetiming 37pp 2004.11.11 2005.04.14 [PDF] [more]
DJB. ``Cache-timing attacks on AES.''
http://cr.yp.to/papers.html#bruteforce 10pp 2005.04.25 refereed 2005.04.25 [PDF] [more]
DJB. ``Understanding brute force.''
http://cr.yp.to/papers.html#powers2 4pp 2004.06.30 refereed 2005.05.09 [PDF] [more]
DJB, Hendrik W. Lenstra, Jr., Jonathan Pila. ``Detecting perfect powers by factoring into coprimes.'' To be printed in Mathematics of Computation.
http://cr.yp.to/papers.html#meecrt 12pp 2003.08.15 refereed 2005.11.09 [PDF] [more]
DJB, Jonathan P. Sorenson. ``Modular exponentiation via the explicit Chinese remainder theorem.'' To be printed in Mathematics of Computation.
http://cr.yp.to/papers.html#abccong 5pp 2003.03.14 refereed printed 2005.12.24 [PDF] [more]
DJB. ``Sharper ABC-based bounds for congruent polynomials.'' Printed in Journal de Theorie des Nombres de Bordeaux 17 (2005), 721-725.
http://cr.yp.to/papers.html#stream256 14pp 2005.12.23 refereed 2006.01.23 [PDF] [more]
DJB. ``Comparison of 256-bit stream ciphers at the beginning of 2006.''
http://cr.yp.to/papers.html#curve25519 22pp 2005.11.15 refereed 2006.02.09 [PDF] [more]
DJB. ``Curve25519: new Diffie-Hellman speed records.''
http://cr.yp.to/papers.html#diffchain 16pp 2006.02.19 2006.02.19 [PDF] [more]
DJB. ``Differential addition chains.''
http://cr.yp.to/papers.html#zkcrypt 4pp 2006.03.02 2006.03.02 [PDF] [more]
DJB. ``Does ZK-Crypt version 1 flunk a repetition test?''
http://cr.yp.to/papers.html#smallheight 20pp 2003.09.18 refereed 2006.05.31 [PDF] [more]
DJB. ``Reducing lattice bases to find small-height values of univariate polynomials.'' To be printed in Algorithmic number theory, edited by Joe Buhler, Peter Stevenhagen.
http://cr.yp.to/papers.html#curvezero 13pp 2006.07.21 2006.07.26 [PDF] [more]
DJB. ``Can we avoid tests for zero in fast elliptic-curve arithmetic?''
http://cr.yp.to/papers.html#zeroseek [more]
DJB. ``A fast journaling filesystem.''
http://cr.yp.to/papers.html#rings [more]
DJB. ``Commutative rings.''
http://cr.yp.to/papers.html#nfspoly [more]
DJB. ``Controlling three coefficients in number-field-sieve polynomials.''
http://cr.yp.to/papers.html#decompress [more]
DJB. ``Data decompression.''
http://cr.yp.to/papers.html#smoothdep [more]
DJB. ``Estimating the dependence time for smooth integers.''
http://cr.yp.to/papers.html#nistp224 [more]
DJB. ``Fast point multiplication on the NIST P-224 elliptic curve.'' To be incorporated into author's High-speed cryptography book.
http://cr.yp.to/papers.html#zmult [more]
DJB. ``Faster multiplication of integers.''
http://cr.yp.to/papers.html#gge [more]
DJB. ``Generalized Gaussian elimination.''
http://cr.yp.to/papers.html#fastgraeffe [more]
DJB. ``High-precision roots of high-degree polynomials.''
http://cr.yp.to/papers.html#mimd [more]
DJB. ``Matrix inversion made difficult.''
http://cr.yp.to/papers.html#hblcs [more]
DJB. ``Predicting a linear congruential sequence from its high bits.''
http://cr.yp.to/papers.html#huptrie [more]
DJB. ``Saving space and time in hash tries.''
http://cr.yp.to/papers.html#senfs [more]
DJB. ``Superelliptic integrals and the number-field sieve.''
http://cr.yp.to/papers.html#surf [more]
DJB. ``SURF: Simple Unpredictable Random Function.''
http://cr.yp.to/papers.html#abc [more]
DJB, Bruce E. Kaskel. ``The ABC polygon.''
http://cr.yp.to/papers.html#c3 [more]
DJB. ``The complexity of complex convolution.''
http://cr.yp.to/papers.html#dal [more]
DJB. ``The ubiquitous dal function.''