What Schools Are Affiliated With Daniel J. Bernstein

Daniel J. Bernstein is affiliated with the following schools: Eindhoven University of Technology, University of California, Berkeley, University of Illinois Chicago

Daniel J. Bernstein | Academic Influence

Why Is Daniel J. Bernstein Influential?

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 professor in the department of mathematics and computer science at the Eindhoven University of Technology.

Daniel J. Bernstein's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Papers

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

This paper list is powered by the following services:

Daniel J. Bernstein

Why Is Daniel J. Bernstein Influential?

Daniel J. Bernstein's Published Works

Published Papers

Other Resources About Daniel J. Bernstein