# Daniel J. Bernstein

#2,159

Most Influential Person Now

American mathematician, cryptologist and programmer

## Daniel J. Bernstein's AcademicInfluence.com Rankings

Daniel J. Bernsteincomputer-science Degrees

Computer Science

#178

World Rank

#185

Historical Rank

#106

USA Rank

Daniel J. Bernsteinmathematics Degrees

Mathematics

#1135

World Rank

#1915

Historical Rank

#486

USA Rank

Algebraic Geometry

#117

World Rank

#124

Historical Rank

#29

USA Rank

Number Theory

#101

World Rank

#138

Historical Rank

#23

USA Rank

Measure Theory

#1556

World Rank

#1931

Historical Rank

#518

USA Rank

## Download Badge

Computer Science Mathematics

## Daniel J. Bernstein's Degrees

- PhD Mathematics University of California, Berkeley
- Masters Mathematics University of California, Berkeley
- Bachelors Mathematics City College of New York

## Similar Degrees You Can Earn

## Why Is Daniel J. Bernstein Influential?

(Suggest an Edit or Addition)According to Wikipedia, Daniel Julius Bernstein is an American German mathematician, cryptologist, and computer scientist. He is a visiting professor at CASA at Ruhr University Bochum, as well as a research professor of Computer Science at the University of Illinois at Chicago. Before this, he was a visiting professor in the department of mathematics and computer science at the Eindhoven University of Technology.

## Daniel J. Bernstein's Published Works

### Published Works

- Cache-timing attacks on AES (2005) (898)
- Curve25519: New Diffie-Hellman Speed Records (2006) (821)
- Post-quantum cryptography (2008) (682)
- High-speed high-security signatures (2011) (601)
- Faster Addition and Doubling on Elliptic Curves (2007) (467)
- The Salsa20 Family of Stream Ciphers (2008) (438)
- Twisted Edwards Curves (2008) (408)
- Attacking and defending the McEliece cryptosystem (2008) (337)
- The Poly1305-AES Message-Authentication Code (2005) (336)
- Introduction to post-quantum cryptography (2009) (301)
- SPHINCS: Practical Stateless Hash-Based Signatures (2015) (297)
- The Security Impact of a New Cryptographic Library (2012) (242)
- On the Security of RC4 in TLS (2013) (210)
- DISTINGUISHING PRIME NUMBERS FROM COMPOSITE NUMBERS (197)
- SipHash: A Fast Short-Input PRF (2012) (187)
- Smaller decoding exponents: ball-collision decoding (2011) (180)
- Elligator: elliptic-curve points indistinguishable from uniform random strings (2013) (168)
- New AES Software Speed Records (2008) (135)
- Binary Edwards Curves (2008) (134)
- Batch Binary Edwards (2009) (130)
- McBits: Fast Constant-Time Code-Based Cryptography (2013) (128)
- NTRU Prime: Reducing Attack Surface at Low Cost (2017) (128)
- Grover vs. McEliece (2010) (126)
- On the Practical Exploitability of Dual EC in TLS Implementations (2014) (126)
- Factoring RSA keys from certified smart cards: Coppersmith in the wild (2013) (102)
- The SPHINCS+ Signature Framework (2019) (100)
- Cost analysis of hash collisions : will quantum computers make SHARCS obsolete? (2009) (96)
- Gimli : A Cross-Platform Permutation (2017) (94)
- Inverted Edwards Coordinates (2007) (88)
- Prime sieves using binary quadratic forms (2003) (88)
- Dual EC: A Standardized Back Door (2015) (83)
- ECM on Graphics Cards (2009) (83)
- Circuits for Integer Factorization: A Proposal (2001) (81)
- conservative code-based cryptography (2017) (78)
- Non-uniform cracks in the concrete: the power of free precomputation (2013) (78)
- On the Security of RC4 in TLS and WPA (2013) (75)
- Stronger Security Bounds for Wegman-Carter-Shoup Authenticators (2005) (74)
- Analysis and optimization of elliptic-curve single-scalar multiplication (2007) (74)
- Kummer Strikes Back: New DH Speed Records (2014) (72)
- Detecting perfect powers in essentially linear time (1998) (70)
- Quantum Algorithms for the Subset-Sum Problem (2013) (69)
- Initial recommendations of long-term secure post-quantum systems (2015) (68)
- How to manipulate curve standards: a white paper for the black hat (2014) (65)
- Progress in Cryptology - AFRICACRYPT 2010, Third International Conference on Cryptology in Africa, Stellenbosch, South Africa, May 3-6, 2010. Proceedings (2010) (62)
- How to Stretch Random Functions: The Security of Protected Counter Sums (1999) (62)
- Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication (2007) (62)
- Faster computation of isogenies of large prime degree (2020) (61)
- On the correct use of the negation map in the Pollard rho method (2011) (59)
- Breaking ECC2K-130 (2009) (58)
- Fast constant-time gcd computation and modular inversion (2019) (58)
- Wild McEliece (2010) (58)
- TweetNaCl: A Crypto Library in 100 Tweets (2014) (57)
- Proving Tight Security for Rabin-Williams Signatures (2008) (57)
- Sliding Right into Disaster: Left-to-Right Sliding Windows Leak (2017) (56)
- Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies (2019) (55)
- ECM using Edwards curves (2012) (55)
- SPHINCS + Submission to the NIST post-quantum project (2017) (55)
- Analysis of QUAD (2007) (54)
- Computing Small Discrete Logarithms Faster (2012) (53)
- List Decoding for Binary Goppa Codes (2011) (51)
- The billion-mulmod-per-second PC (2009) (51)
- Pippenger's Exponentiation Algorithm (2002) (50)
- Twisted Hessian Curves (2015) (50)
- Proving primality in essentially quartic random time (2007) (50)
- Post-quantum RSA (2017) (49)
- Factoring into coprimes in essentially linear time (2005) (49)
- Never Trust a Bunny (2012) (47)
- Understanding brute force (2005) (47)
- Some thoughts on security after ten years of qmail 1.0 (2007) (46)
- Curve41417: Karatsuba revisited (2014) (45)
- Tighter, faster, simpler side-channel security evaluations beyond computing power (2015) (45)
- MULTIDIGIT MULTIPLICATION FOR MATHEMATICIANS (2022) (44)
- FLOATING-POINT ARITHMETIC AND MESSAGE AUTHENTICATION (2000) (43)
- A complete set of addition laws for incomplete Edwards curves (2011) (41)
- Differential addition chains (2006) (41)
- NTRU Prime (2016) (40)
- Montgomery curves and the Montgomery ladder (2017) (39)
- Hash-Function Based PRFs: AMAC and Its Multi-User Security (2016) (39)
- The 3x + 1 Conjugacy Map (1996) (37)
- MinimaLT: minimal-latency networking through better security (2013) (37)
- Modular exponentiation via the explicit Chinese remainder theorem (2007) (33)
- ECC2K-130 on NVIDIA GPUs (2010) (33)
- Better price-performance ratios for generalized birthday attacks (2007) (32)
- HOW TO FIND SMOOTH PARTS OF INTEGERS (2004) (32)
- Multi-user Schnorr security, revisited (2015) (31)
- Faster Batch Forgery Identification (2012) (30)
- Post-quantum cryptography - dealing with the fallout of physics success (2017) (29)
- A short proof of the unpredictability of cipher block chaining (28)
- Progress in Cryptology - INDOCRYPT 2011 - 12th International Conference on Cryptology in India, Chennai, India, December 11-14, 2011. Proceedings (2011) (28)
- Really Fast Syndrome-Based Hashing (2011) (27)
- Enumerating solutions to p(a) + q(b) = r(c) + s(d) (2001) (27)
- Low-Communication Parallel Quantum Multi-Target Preimage Search (2017) (27)
- Faster Binary-Field Multiplication and Faster Binary-Field MACs (2014) (26)
- Explicit bounds for generic decoding algorithms for code-based cryptography (2009) (26)
- Concrete quantum cryptanalysis of binary elliptic curves (2020) (25)
- Composing Power Series Over a Finite Ring in Essentially Linear Time (1998) (25)
- Wild McEliece Incognito (2011) (25)
- Short Generators Without Quantum Computers: The Case of Multiquadratics (2017) (25)
- Type-II Optimal Polynomial Bases (2010) (25)
- Two grumpy giants and a baby (2013) (24)
- EdDSA for more curves (2015) (23)
- HILA5 Pindakaas: On the CCA security of lattice-based encryption with error correction (2018) (23)
- Optimizing linear maps modulo 2 (2009) (23)
- Detecting perfect powers by factoring into coprimes (2007) (22)
- HOW TO FIND SMALL FACTORS OF INTEGERS (2000) (21)
- Towards KEM Unification (2018) (21)
- The Tangent FFT (2007) (21)
- Comparing proofs of security for lattice-based encryption (2019) (21)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (2011) (20)
- SCALED REMAINDER TREES (19)
- Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB (2009) (18)
- The new SHA-3 software shootout (2012) (18)
- Starfish on Strike (2010) (16)
- Hyper-and-elliptic-curve cryptography (2014) (16)
- Asymptotically faster quantum algorithms to solve multivariate quadratic equations (2018) (15)
- Double-base scalar multiplication revisited (2017) (14)
- The Certicom Challenges ECC2-X (2009) (14)
- Decisional second-preimage resistance: When does SPR imply PRE? (2019) (14)
- What output size resists collisions in a xor of independent expansions ? (2007) (14)
- Faster 2-Regular Information-Set Decoding (2011) (14)
- A Low-Resource Quantum Factoring Algorithm (2017) (13)
- Multidigit Modular Multiplication With The Explicit Chinese Remainder Theorem (1995) (12)
- Cycle counts for authenticated encryption (2007) (11)
- Stronger security bounds for permutations (11)
- Which phase-3 eSTREAM ciphers provide the best software speeds ? (2008) (10)
- Is the security of quantum cryptography guaranteed by the laws of physics? (2018) (10)
- Draft. Aimed at Mathemati s of Computation. FASTER SQUARE ROOTS IN ANNOYING FINITE FIELDS (2007) (10)
- A Secure Public-Key Signature System With Extremely Fast Verification (2000) (10)
- Cryptographic competitions (2020) (10)
- Batch NFS (2014) (10)
- CTIDH: faster constant-time CSIDH (2021) (9)
- Faster discrete logarithms on FPGAs (2016) (9)
- Bounding Smooth Integers (1998) (9)
- Bad directions in cryptographic hash functions (2015) (9)
- PROVING TIGHT SECURITY FOR STANDARD RABIN-WILLIAMS SIGNATURES (2003) (8)
- Failures in NIST ’ s ECC standards (2015) (8)
- RSA signatures and Rabin – Williams signatures : the state of the art (2008) (8)
- Faster elliptic-curve discrete logarithms on FPGAs (2016) (8)
- Investigating SRAM PUFs in large CPUs and GPUs (2015) (7)
- OpenSSLNTRU: Faster post-quantum TLS key exchange (2021) (7)
- Enumerating and Counting Smooth Integers (1995) (7)
- Integer factorization (1994) (7)
- Response to \Slid Pairs in Salsa20 and Trivium" (2008) (7)
- Non-randomness of S-unit lattices (2021) (7)
- Ball-collision decoding (2010) (6)
- Fast Ideal Artithmetic via Lazy Localization (1996) (6)
- COMPUTING LOGARITHM INTERVALS WITH THE ARITHMETIC-GEOMETRIC-MEAN ITERATION (2022) (5)
- Comparison of 256-bit stream ciphers (2006) (4)
- Extending the Salsa 20 nonce (2008) (4)
- Efficient point-counting on genus-2 hyperelliptic curves (2009) (4)
- Visualizing size-security tradeoffs for lattice-based encryption (2019) (4)
- Proving Primality In Essentially Quartic Expected Time (2003) (4)
- SPHINCS+ - Submission to the NIST post-quantum cryptography project (2017) (4)
- McTiny: fast high-confidence post-quantum key erasure for tiny network servers (2019) (4)
- Can we avoid tests for zero in fast elliptic-curve arithmetic ? (2006) (4)
- Notes on the Salsa20 key size (2005) (3)
- A 3D Finite Element Solver for the Initial Value Problem (1998) (3)
- Comparison of 256-bit stream ciphers at the beginning of 2006 (2006) (3)
- Divergence bounds for random fixed-weight vectors obtained by sorting (2017) (3)
- Usable assembly language for GPUs: a success story (2012) (3)
- Gimli: NIST LWC Second-round Candidate Status Update (2020) (3)
- fast constant-time code-based cryptography (2013) (2)
- DISTINGUISHING PRIME NUMBERS FROM COMPOSITE NUMBERS : THE STATE OF THE ART IN 2004 (2013) (2)
- On the looseness of FO derandomization (2021) (2)
- 23rd USENIX Security Symposium (2014) (2)
- The Certicom Challenges ECC 2X (2017) (1)
- ANTS X Proceedings of the Tenth Algorithmic Number Theory Symposium msp Two grumpy giants and a baby (2013) (1)
- BasicBlocker: Redesigning ISAs to Eliminate Speculative-Execution Attacks (2020) (1)
- Salsa 20 security (1996) (1)
- Public-Key Authenticated Encryption (2011) (1)
- How to manipulate curve standards (2015) (1)
- VIA THE EXPLICIT CHINESE REMAINDER THEOREM (2006) (1)
- Verified fast formulas for control bits for permutation networks (2020) (1)
- FASTER SQUARE ROOTS IN ANNOYING FINITE FIELDS (2022) (1)
- Salsa 20 design (1)
- Understanding binary-Goppa decoding (2022) (1)
- Jailx protecting users from x applications (2006) (1)
- A one-time single-bit fault leaks all previous NTRU-HRSS session keys to a chosen-ciphertext attack (2022) (1)
- High-speed high-security signatures (2012) (1)
- A SIMPLE UNIVERSAL PATTERN-MATCHING AUTOMATON (2000) (0)
- Cryptanalysis of Skein (2010) (0)
- Calculus for mathematicians (2022) (0)
- Quantum attacks against Blue Midnight Wish, ECHO, Fugue, Grstl, Hamsi, JH, Keccak, Shabal, SHAvite-3, SIMD, and Skein (2010) (0)
- Multi-ciphertext security degradation for lattices (2022) (0)
- The Future of Crypto: Getting from Here to Guarantees (2014) (0)
- Breaking ECC 2 K-130 (2017) (0)
- Notes on the Salsa 20 key size (0)
- Review of the Book " Post-quantum Cryptography " 3 Main Review (0)
- List of conferences (2006) (0)
- Design and implementation of a publi-key signature system (2020) (0)
- BasicBlocker: ISA Redesign to Make Spectre-Immune CPUs Faster (2020) (0)
- Factorization Circuits (2011) (0)
- KRONECKER MATRICES AND POLYNOMIAL GCDS (2007) (0)
- Curve-Based Cryptography (2017) (0)
- Observations on COMET (2020) (0)
- Proceedings of the 12th international conference on Cryptology in India (2011) (0)
- Quantum circuits for the CSIDH (2019) (0)
- Elliptic curves for applications (Tutorial) (2011) (0)
- Sharper ABC-based bounds for congruent polynomials par (2006) (0)
- Addition formulas for elliptic curves (2013) (0)
- Computational aspects of Commutative Algebra and Algebraic Geometry (2008) (0)
- Curve 41417 : Karatsuba Revisited (2014) (0)
- A discretization attack (2020) (0)
- The SPHINCS + Signature Framework Full version , September 23 , 2019 (2019) (0)
- Contemporary Mathematics Polynomial evaluation and message authentication (2007) (0)
- Subreviewers (2020) (0)
- Proceedings of the Third international conference on Cryptology in Africa (2010) (0)
- File System Permissions (2011) (0)
- Private Key Cryptosystem (2006) (0)
- Fast norm computation in smooth-degree Abelian number fields (2022) (0)

This paper list is powered by the following services:

## Other Resources About Daniel J. Bernstein

## What Schools Are Affiliated With Daniel J. Bernstein?

Daniel J. Bernstein is affiliated with the following schools: