


default search action
Daniel J. Bernstein
Person information
- affiliation: University of Illinois at Chicago, Department of Computer Science
- affiliation: TU Eindhoven, Department of Mathematics and Computer Science
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j19]Daniel J. Bernstein, Karthikeyan Bhargavan, Shivam Bhasin, Anupam Chattopadhyay, Tee Kiah Chia, Matthias J. Kannwischer, Franziskus Kiefer, Thales B. Paiva, Prasanna Ravi, Goutam Tamvada:
KyberSlash: Exploiting secret-dependent division timings in Kyber implementations. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2025(2): 209-234 (2025) - [c78]Daniel J. Bernstein, Tanja Lange, Jonathan Levin, Bo-Yin Yang:
PQConnect: Automated Post-Quantum End-to-End Tunnels. NDSS 2025 - 2024
- [j18]Daniel J. Bernstein:
Understanding binary-Goppa decoding. IACR Commun. Cryptol. 1(1): 14 (2024) - [j17]Daniel J. Bernstein:
Cryptographic Competitions. J. Cryptol. 37(1): 7 (2024) - [c77]Daniel J. Bernstein, Tung Chou:
CryptAttackTester: high-assurance attack analysis. CRYPTO (6) 2024: 141-182 - [i106]Daniel J. Bernstein:
Asymptotics for the standard block size in primal lattice attacks: second order, formally verified. IACR Cryptol. ePrint Arch. 2024: 592 (2024) - [i105]Daniel J. Bernstein, Jolijn Cottaar, Tanja Lange:
Searching for differential addition chains. IACR Cryptol. ePrint Arch. 2024: 1044 (2024) - [i104]Daniel J. Bernstein, Karthikeyan Bhargavan, Shivam Bhasin, Anupam Chattopadhyay, Tee Kiah Chia, Matthias J. Kannwischer, Franziskus Kiefer, Thales B. Paiva, Prasanna Ravi, Goutam Tamvada:
KyberSlash: Exploiting secret-dependent division timings in Kyber implementations. IACR Cryptol. ePrint Arch. 2024: 1049 (2024) - [i103]Daniel J. Bernstein, Tanja Lange:
Safe curves for elliptic-curve cryptography. IACR Cryptol. ePrint Arch. 2024: 1265 (2024) - [i102]Daniel J. Bernstein, Jolijn Cottaar, Emanuele Di Giandomenico, Kathrin Hövelmanns, Andreas Hülsing, Mikhail A. Kudinov, Tanja Lange, Mairon Mahzoun, Matthias Meijers, Alex Pellegrini, Alberto Ravagnani, Silvia Ritsch, Sven Schäge, Tianxin Tang, Monika Trimoska, Marc Vorstermans, Fiona Johanna Weber:
Report on evaluation of KpqC Round-2 candidates. IACR Cryptol. ePrint Arch. 2024: 2077 (2024) - [i101]Daniel J. Bernstein, Tanja Lange, Jonathan Levin, Bo-Yin Yang:
PQConnect: Automated Post-Quantum End-to-End Tunnels. IACR Cryptol. ePrint Arch. 2024: 2092 (2024) - 2023
- [i100]Daniel J. Bernstein, Tung Chou:
CryptAttackTester: formalizing attack analyses. IACR Cryptol. ePrint Arch. 2023: 940 (2023) - [i99]Daniel J. Bernstein:
Quantifying risks in cryptographic selection processes. IACR Cryptol. ePrint Arch. 2023: 1838 (2023) - [i98]Daniel J. Bernstein:
Predicting performance for post-quantum encrypted-file systems. IACR Cryptol. ePrint Arch. 2023: 1878 (2023) - [i97]Daniel J. Bernstein:
Asymptotics of hybrid primal lattice attacks. IACR Cryptol. ePrint Arch. 2023: 1892 (2023) - [i96]Daniel J. Bernstein:
Analyzing the complexity of reference post-quantum software. IACR Cryptol. ePrint Arch. 2023: 1924 (2023) - 2022
- [c76]Daniel J. Bernstein:
A One-Time Single-bit Fault Leaks All Previous NTRU-HRSS Session Keys to a Chosen-Ciphertext Attack. INDOCRYPT 2022: 617-643 - [c75]Daniel J. Bernstein, Billy Bob Brumley, Ming-Shing Chen, Nicola Tuveri:
OpenSSLNTRU: Faster post-quantum TLS key exchange. USENIX Security Symposium 2022: 845-862 - [i95]Daniel J. Bernstein:
Understanding binary-Goppa decoding. IACR Cryptol. ePrint Arch. 2022: 473 (2022) - [i94]Daniel J. Bernstein:
Fast norm computation in smooth-degree Abelian number fields. IACR Cryptol. ePrint Arch. 2022: 980 (2022) - [i93]Daniel J. Bernstein:
A one-time single-bit fault leaks all previous NTRU-HRSS session keys to a chosen-ciphertext attack. IACR Cryptol. ePrint Arch. 2022: 1125 (2022) - [i92]Daniel J. Bernstein:
Multi-ciphertext security degradation for lattices. IACR Cryptol. ePrint Arch. 2022: 1580 (2022) - 2021
- [j16]Gustavo Banegas
, Daniel J. Bernstein, Iggy van Hoof, Tanja Lange:
Concrete quantum cryptanalysis of binary elliptic curves. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(1): 451-472 (2021) - [j15]Gustavo Banegas
, Daniel J. Bernstein, Fabio Campos
, Tung Chou, Tanja Lange, Michael Meyer
, Benjamin Smith
, Jana Sotáková
:
CTIDH: faster constant-time CSIDH. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(4): 351-387 (2021) - [c74]Jan Philipp Thoma
, Jakob Feldtkeller
, Markus Krausz
, Tim Güneysu
, Daniel J. Bernstein:
BasicBlocker: ISA Redesign to Make Spectre-Immune CPUs Faster. RAID 2021: 103-118 - [i91]Daniel J. Bernstein, Billy Bob Brumley, Ming-Shing Chen, Nicola Tuveri:
OpenSSLNTRU: Faster post-quantum TLS key exchange. CoRR abs/2106.08759 (2021) - [i90]Gustavo Banegas, Daniel J. Bernstein, Fabio Campos, Tung Chou, Tanja Lange, Michael Meyer, Benjamin Smith, Jana Sotáková:
CTIDH: faster constant-time CSIDH. IACR Cryptol. ePrint Arch. 2021: 633 (2021) - [i89]Daniel J. Bernstein, Billy Bob Brumley, Ming-Shing Chen, Nicola Tuveri:
OpenSSLNTRU: Faster post-quantum TLS key exchange. IACR Cryptol. ePrint Arch. 2021: 826 (2021) - [i88]Daniel J. Bernstein:
On the looseness of FO derandomization. IACR Cryptol. ePrint Arch. 2021: 912 (2021) - [i87]Daniel J. Bernstein, Tanja Lange:
Non-randomness of S-unit lattices. IACR Cryptol. ePrint Arch. 2021: 1428 (2021) - 2020
- [c73]Daniel J. Bernstein, Tanja Lange:
McTiny: Fast High-Confidence Post-Quantum Key Erasure for Tiny Network Servers. USENIX Security Symposium 2020: 1731-1748 - [i86]Daniel J. Bernstein, Luca De Feo, Antonin Leroux, Benjamin Smith
:
Faster computation of isogenies of large prime degree. CoRR abs/2003.10118 (2020) - [i85]Jan Philipp Thoma
, Jakob Feldtkeller
, Markus Krausz
, Tim Güneysu, Daniel J. Bernstein:
BasicBlocker: Redesigning ISAs to Eliminate Speculative-Execution Attacks. CoRR abs/2007.15919 (2020) - [i84]Daniel J. Bernstein, Luca De Feo, Antonin Leroux, Benjamin Smith:
Faster computation of isogenies of large prime degree. IACR Cryptol. ePrint Arch. 2020: 341 (2020) - [i83]Gustavo Banegas, Daniel J. Bernstein, Iggy van Hoof, Tanja Lange:
Concrete quantum cryptanalysis of binary elliptic curves. IACR Cryptol. ePrint Arch. 2020: 1296 (2020) - [i82]Daniel J. Bernstein:
A discretization attack. IACR Cryptol. ePrint Arch. 2020: 1370 (2020) - [i81]Daniel J. Bernstein, Henri Gilbert, Meltem Sönmez Turan:
Observations on COMET. IACR Cryptol. ePrint Arch. 2020: 1445 (2020) - [i80]Daniel J. Bernstein:
Verified fast formulas for control bits for permutation networks. IACR Cryptol. ePrint Arch. 2020: 1493 (2020) - [i79]Daniel J. Bernstein:
Cryptographic competitions. IACR Cryptol. ePrint Arch. 2020: 1608 (2020)
2010 – 2019
- 2019
- [j14]Daniel J. Bernstein, Bo-Yin Yang:
Fast constant-time gcd computation and modular inversion. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(3): 340-398 (2019) - [c72]Daniel J. Bernstein, Andreas Hülsing
:
Decisional Second-Preimage Resistance: When Does SPR Imply PRE? ASIACRYPT (3) 2019: 33-62 - [c71]Daniel J. Bernstein, Andreas Hülsing
, Stefan Kölbl, Ruben Niederhagen, Joost Rijneveld, Peter Schwabe:
The SPHINCS+ Signature Framework. CCS 2019: 2129-2146 - [c70]Daniel J. Bernstein, Tanja Lange, Chloe Martindale, Lorenz Panny:
Quantum Circuits for the CSIDH: Optimizing Quantum Evaluation of Isogenies. EUROCRYPT (2) 2019: 409-441 - [i78]Daniel J. Bernstein, Bo-Yin Yang:
Fast constant-time gcd computation and modular inversion. IACR Cryptol. ePrint Arch. 2019: 266 (2019) - [i77]Daniel J. Bernstein, Andreas Hülsing:
Decisional second-preimage resistance: When does SPR imply PRE? IACR Cryptol. ePrint Arch. 2019: 492 (2019) - [i76]Daniel J. Bernstein:
Visualizing size-security tradeoffs for lattice-based encryption. IACR Cryptol. ePrint Arch. 2019: 655 (2019) - [i75]Daniel J. Bernstein:
Comparing proofs of security for lattice-based encryption. IACR Cryptol. ePrint Arch. 2019: 691 (2019) - [i74]Daniel J. Bernstein, Andreas Hülsing, Stefan Kölbl, Ruben Niederhagen, Joost Rijneveld, Peter Schwabe:
The SPHINCS+ Signature Framework. IACR Cryptol. ePrint Arch. 2019: 1086 (2019) - [i73]Daniel J. Bernstein, Tanja Lange:
McTiny: fast high-confidence post-quantum key erasure for tiny network servers. IACR Cryptol. ePrint Arch. 2019: 1395 (2019) - 2018
- [c69]Daniel J. Bernstein, Leon Groot Bruinderink, Tanja Lange, Lorenz Panny:
HILA5 Pindakaas: On the CCA Security of Lattice-Based Encryption with Error Correction. AFRICACRYPT 2018: 203-216 - [c68]Daniel J. Bernstein, Bo-Yin Yang
:
Asymptotically Faster Quantum Algorithms to Solve Multivariate Quadratic Equations. PQCrypto 2018: 487-506 - [i72]Daniel J. Bernstein:
Is the security of quantum cryptography guaranteed by the laws of physics? CoRR abs/1803.04520 (2018) - [i71]Daniel J. Bernstein, Edoardo Persichetti:
Towards KEM Unification. IACR Cryptol. ePrint Arch. 2018: 526 (2018) - [i70]Daniel J. Bernstein, Tanja Lange, Chloe Martindale, Lorenz Panny:
Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies. IACR Cryptol. ePrint Arch. 2018: 1059 (2018) - 2017
- [j13]Daniel J. Bernstein, Tanja Lange:
Post-quantum cryptography. Nat. 549(7671): 188-194 (2017) - [c67]Daniel J. Bernstein, Stefan Kölbl, Stefan Lucks, Pedro Maat Costa Massolino, Florian Mendel
, Kashif Nawaz
, Tobias Schneider, Peter Schwabe, François-Xavier Standaert
, Yosuke Todo
, Benoît Viguier:
Gimli : A Cross-Platform Permutation. CHES 2017: 299-320 - [c66]Daniel J. Bernstein, Joachim Breitner, Daniel Genkin, Leon Groot Bruinderink, Nadia Heninger, Tanja Lange, Christine van Vredendaal, Yuval Yarom
:
Sliding Right into Disaster: Left-to-Right Sliding Windows Leak. CHES 2017: 555-576 - [c65]Jens Bauch, Daniel J. Bernstein, Henry de Valence, Tanja Lange, Christine van Vredendaal:
Short Generators Without Quantum Computers: The Case of Multiquadratics. EUROCRYPT (1) 2017: 27-59 - [c64]Daniel J. Bernstein, Nadia Heninger, Paul Lou, Luke Valenta:
Post-quantum RSA. PQCrypto 2017: 311-329 - [c63]Daniel J. Bernstein, Jean-François Biasse
, Michele Mosca:
A Low-Resource Quantum Factoring Algorithm. PQCrypto 2017: 330-346 - [c62]Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange, Christine van Vredendaal:
NTRU Prime: Reducing Attack Surface at Low Cost. SAC 2017: 235-260 - [c61]Gustavo Banegas, Daniel J. Bernstein:
Low-Communication Parallel Quantum Multi-Target Preimage Search. SAC 2017: 325-335 - [i69]Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange:
Double-base scalar multiplication revisited. IACR Cryptol. ePrint Arch. 2017: 37 (2017) - [i68]Daniel J. Bernstein, Tanja Lange:
Montgomery curves and the Montgomery ladder. IACR Cryptol. ePrint Arch. 2017: 293 (2017) - [i67]Daniel J. Bernstein, Tanja Lange:
Post-quantum cryptography - dealing with the fallout of physics success. IACR Cryptol. ePrint Arch. 2017: 314 (2017) - [i66]Daniel J. Bernstein, Nadia Heninger, Paul Lou, Luke Valenta:
Post-quantum RSA. IACR Cryptol. ePrint Arch. 2017: 351 (2017) - [i65]Daniel J. Bernstein, Jean-François Biasse, Michele Mosca:
A low-resource quantum factoring algorithm. IACR Cryptol. ePrint Arch. 2017: 352 (2017) - [i64]Jens Bauch, Daniel J. Bernstein, Henry de Valence, Tanja Lange, Christine van Vredendaal:
Short generators without quantum computers: the case of multiquadratics. IACR Cryptol. ePrint Arch. 2017: 404 (2017) - [i63]Daniel J. Bernstein, Joachim Breitner, Daniel Genkin, Leon Groot Bruinderink, Nadia Heninger, Tanja Lange, Christine van Vredendaal, Yuval Yarom:
Sliding right into disaster: Left-to-right sliding windows leak. IACR Cryptol. ePrint Arch. 2017: 627 (2017) - [i62]Daniel J. Bernstein, Stefan Kölbl, Stefan Lucks, Pedro Maat Costa Massolino, Florian Mendel, Kashif Nawaz, Tobias Schneider, Peter Schwabe, François-Xavier Standaert, Yosuke Todo, Benoît Viguier:
Gimli: a cross-platform permutation. IACR Cryptol. ePrint Arch. 2017: 630 (2017) - [i61]Gustavo Banegas, Daniel J. Bernstein:
Low-communication parallel quantum multi-target preimage search. IACR Cryptol. ePrint Arch. 2017: 789 (2017) - [i60]Daniel J. Bernstein, Bo-Yin Yang:
Asymptotically faster quantum algorithms to solve multivariate quadratic equations. IACR Cryptol. ePrint Arch. 2017: 1206 (2017) - [i59]Daniel J. Bernstein, Leon Groot Bruinderink, Tanja Lange, Lorenz Panny:
HILA5 Pindakaas: On the CCA security of lattice-based encryption with error correction. IACR Cryptol. ePrint Arch. 2017: 1214 (2017) - 2016
- [c60]Daniel J. Bernstein, Tanja Lange, Ruben Niederhagen:
Dual EC: A Standardized Back Door. The New Codebreakers 2016: 256-281 - [c59]Mihir Bellare, Daniel J. Bernstein, Stefano Tessaro:
Hash-Function Based PRFs: AMAC and Its Multi-User Security. EUROCRYPT (1) 2016: 566-595 - [i58]Mihir Bellare, Daniel J. Bernstein, Stefano Tessaro:
Hash-Function based PRFs: AMAC and its Multi-User Security. IACR Cryptol. ePrint Arch. 2016: 142 (2016) - [i57]Daniel J. Bernstein, Susanne Engels, Tanja Lange, Ruben Niederhagen, Christof Paar, Peter Schwabe, Ralf Zimmermann:
Faster discrete logarithms on FPGAs. IACR Cryptol. ePrint Arch. 2016: 382 (2016) - [i56]Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange, Christine van Vredendaal:
NTRU Prime. IACR Cryptol. ePrint Arch. 2016: 461 (2016) - 2015
- [c58]Daniel J. Bernstein, Andreas Hülsing
, Tanja Lange, Ruben Niederhagen:
Bad Directions in Cryptographic Hash Functions. ACISP 2015: 488-508 - [c57]Daniel J. Bernstein, Daira Hopwood
, Andreas Hülsing
, Tanja Lange, Ruben Niederhagen, Louiza Papachristodoulou, Michael Schneider, Peter Schwabe, Zooko Wilcox-O'Hearn:
SPHINCS: Practical Stateless Hash-Based Signatures. EUROCRYPT (1) 2015: 368-397 - [c56]Daniel J. Bernstein, Chitchanok Chuengsatiansup, David Kohel, Tanja Lange:
Twisted Hessian Curves. LATINCRYPT 2015: 269-294 - [c55]Daniel J. Bernstein, Tung Chou
, Chitchanok Chuengsatiansup, Andreas Hülsing
, Eran Lambooij, Tanja Lange, Ruben Niederhagen, Christine van Vredendaal:
How to Manipulate Curve Standards: A White Paper for the Black Hat http: //bada55.cr.yp.to. SSR 2015: 109-139 - [c54]Pol Van Aubel, Daniel J. Bernstein, Ruben Niederhagen:
Investigating SRAM PUFs in large CPUs and GPUs. SPACE 2015: 228-247 - [i55]Pol Van Aubel, Daniel J. Bernstein, Ruben Niederhagen:
Investigating SRAM PUFs in large CPUs and GPUs. CoRR abs/1507.08514 (2015) - [i54]Daniel J. Bernstein, Andreas Hülsing, Tanja Lange, Ruben Niederhagen:
Bad directions in cryptographic hash functions. IACR Cryptol. ePrint Arch. 2015: 151 (2015) - [i53]Daniel J. Bernstein, Tanja Lange, Christine van Vredendaal:
Tighter, faster, simpler side-channel security evaluations beyond computing power. IACR Cryptol. ePrint Arch. 2015: 221 (2015) - [i52]Daniel J. Bernstein, Tung Chou, Peter Schwabe:
McBits: fast constant-time code-based cryptography. IACR Cryptol. ePrint Arch. 2015: 610 (2015) - [i51]Daniel J. Bernstein, Simon Josefsson, Tanja Lange, Peter Schwabe, Bo-Yin Yang:
EdDSA for more curves. IACR Cryptol. ePrint Arch. 2015: 677 (2015) - [i50]Pol Van Aubel, Daniel J. Bernstein, Ruben Niederhagen:
Investigating SRAM PUFs in large CPUs and GPUs. IACR Cryptol. ePrint Arch. 2015: 760 (2015) - [i49]Daniel J. Bernstein, Tanja Lange, Ruben Niederhagen:
Dual EC: A Standardized Back Door. IACR Cryptol. ePrint Arch. 2015: 767 (2015) - [i48]Daniel J. Bernstein, Chitchanok Chuengsatiansup, David Kohel, Tanja Lange:
Twisted Hessian curves. IACR Cryptol. ePrint Arch. 2015: 781 (2015) - [i47]Daniel J. Bernstein:
Multi-user Schnorr security, revisited. IACR Cryptol. ePrint Arch. 2015: 996 (2015) - 2014
- [j12]Daniel J. Bernstein, Tanja Lange:
Hyper-and-elliptic-curve cryptography. LMS J. Comput. Math. 17(Theory): 181-202 (2014) - [c53]Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange, Peter Schwabe:
Kummer Strikes Back: New DH Speed Records. ASIACRYPT (1) 2014: 317-337 - [c52]Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange:
Curve41417: Karatsuba Revisited. CHES 2014: 316-334 - [c51]Daniel J. Bernstein, Bernard van Gastel, Wesley Janssen, Tanja Lange, Peter Schwabe, Sjaak Smetsers:
TweetNaCl: A Crypto Library in 100 Tweets. LATINCRYPT 2014: 64-83 - [c50]Daniel J. Bernstein, Tanja Lange:
Batch NFS. Selected Areas in Cryptography 2014: 38-58 - [c49]Daniel J. Bernstein, Tung Chou
:
Faster Binary-Field Multiplication and Faster Binary-Field MACs. Selected Areas in Cryptography 2014: 92-111 - [c48]Stephen Checkoway, Ruben Niederhagen, Adam Everspaugh, Matthew Green, Tanja Lange, Thomas Ristenpart, Daniel J. Bernstein, Jake Maskiewicz, Hovav Shacham, Matthew Fredrikson:
On the Practical Exploitability of Dual EC in TLS Implementations. USENIX Security Symposium 2014: 319-335 - [i46]Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange, Peter Schwabe:
Kummer strikes back: new DH speed records. IACR Cryptol. ePrint Arch. 2014: 134 (2014) - [i45]Daniel J. Bernstein, Tanja Lange:
Hyper-and-elliptic-curve cryptography. IACR Cryptol. ePrint Arch. 2014: 379 (2014) - [i44]Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange:
Curve41417: Karatsuba revisited. IACR Cryptol. ePrint Arch. 2014: 526 (2014) - [i43]Daniel J. Bernstein, Tung Chou, Chitchanok Chuengsatiansup, Andreas Hülsing, Tanja Lange, Ruben Niederhagen, Christine van Vredendaal:
How to manipulate curve standards: a white paper for the black hat. IACR Cryptol. ePrint Arch. 2014: 571 (2014) - [i42]Daniel J. Bernstein, Tung Chou:
Faster Binary-Field Multiplication and Faster Binary-Field MACs. IACR Cryptol. ePrint Arch. 2014: 729 (2014) - [i41]Daniel J. Bernstein, Daira Hopwood, Andreas Hülsing, Tanja Lange, Ruben Niederhagen, Louiza Papachristodoulou, Peter Schwabe, Zooko Wilcox-O'Hearn:
SPHINCS: practical stateless hash-based signatures. IACR Cryptol. ePrint Arch. 2014: 795 (2014) - [i40]Daniel J. Bernstein, Tanja Lange:
Batch NFS. IACR Cryptol. ePrint Arch. 2014: 921 (2014) - 2013
- [j11]Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters:
ECM using Edwards curves. Math. Comput. 82(282): 1139-1179 (2013) - [c47]Daniel J. Bernstein, Tanja Lange:
Non-uniform Cracks in the Concrete: The Power of Free Precomputation. ASIACRYPT (2) 2013: 321-340 - [c46]Daniel J. Bernstein, Yun-An Chang, Chen-Mou Cheng, Li-Ping Chou, Nadia Heninger, Tanja Lange, Nicko van Someren:
Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild. ASIACRYPT (2) 2013: 341-360 - [c45]W. Michael Petullo, Xu Zhang, Jon A. Solworth, Daniel J. Bernstein, Tanja Lange:
MinimaLT: minimal-latency networking through better security. CCS 2013: 425-438 - [c44]Daniel J. Bernstein, Mike Hamburg, Anna Krasnova, Tanja Lange:
Elligator: elliptic-curve points indistinguishable from uniform random strings. CCS 2013: 967-980 - [c43]Daniel J. Bernstein, Tung Chou
, Peter Schwabe:
McBits: Fast Constant-Time Code-Based Cryptography. CHES 2013: 250-272 - [c42]Daniel J. Bernstein, Stacey Jeffery
, Tanja Lange, Alexander Meurer:
Quantum Algorithms for the Subset-Sum Problem. PQCrypto 2013: 16-33 - [c41]Nadhem J. AlFardan, Daniel J. Bernstein, Kenneth G. Paterson, Bertram Poettering, Jacob C. N. Schuldt:
On the Security of RC4 in TLS. USENIX Security Symposium 2013: 305-320 - [p2]Daniel J. Bernstein, Tanja Lange:
Addition formulas for elliptic curves. Handbook of Finite Fields 2013: 440-446 - [i39]Daniel J. Bernstein, Stacey Jeffery, Tanja Lange, Alexander Meurer:
Quantum algorithms for the subset-sum problem. IACR Cryptol. ePrint Arch. 2013: 199 (2013) - [i38]W. Michael Petullo, Xu Zhang, Jon A. Solworth, Daniel J. Bernstein, Tanja Lange:
MinimaLT: Minimal-latency Networking Through Better Security. IACR Cryptol. ePrint Arch. 2013: 310 (2013) - [i37]Daniel J. Bernstein, Anna Krasnova, Tanja Lange:
Elligator: Elliptic-curve points indistinguishable from uniform random strings. IACR Cryptol. ePrint Arch. 2013: 325 (2013) - [i36]Daniel J. Bernstein, Yun-An Chang, Chen-Mou Cheng, Li-Ping Chou, Nadia Heninger, Tanja Lange, Nicko van Someren:
Factoring RSA keys from certified smart cards: Coppersmith in the wild. IACR Cryptol. ePrint Arch. 2013: 599 (2013) - 2012
- [j10]Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, Bo-Yin Yang:
High-speed high-security signatures. J. Cryptogr. Eng. 2(2): 77-89 (2012) - [c40]Daniel J. Bernstein, Peter Schwabe:
NEON Crypto. CHES 2012: 320-339 - [c39]Daniel J. Bernstein, Tanja Lange:
Computing Small Discrete Logarithms Faster. INDOCRYPT 2012: 317-338 - [c38]Daniel J. Bernstein, Jeroen Doumen, Tanja Lange, Jan-Jaap Oosterwijk:
Faster Batch Forgery Identification. INDOCRYPT 2012: 454-473 - [c37]Jean-Philippe Aumasson, Daniel J. Bernstein:
SipHash: A Fast Short-Input PRF. INDOCRYPT 2012: 489-508 - [c36]Daniel J. Bernstein, Tanja Lange, Peter Schwabe:
The Security Impact of a New Cryptographic Library. LATINCRYPT 2012: 159-176 - [c35]Daniel J. Bernstein, Tanja Lange:
Never Trust a Bunny. RFIDSec 2012: 137-148 - [i35]Daniel J. Bernstein, Hsieh-Chung Chen, Chen-Mou Cheng, Tanja Lange, Ruben Niederhagen, Peter Schwabe, Bo-Yin Yang:
ECC2K-130 on NVIDIA GPUs. IACR Cryptol. ePrint Arch. 2012: 2 (2012) - [i34]Daniel J. Bernstein, Tanja Lange:
The new SHA-3 software shootout. IACR Cryptol. ePrint Arch. 2012: 4 (2012) - [i33]Daniel J. Bernstein, Hsieh-Chung Chen, Chen-Mou Cheng, Tanja Lange, Ruben Niederhagen, Peter Schwabe, Bo-Yin Yang:
Usable assembly language for GPUs: a success story. IACR Cryptol. ePrint Arch. 2012: 137 (2012) - [i32]Daniel J. Bernstein, Tanja Lange:
Two grumpy giants and a baby. IACR Cryptol. ePrint Arch. 2012: 294 (2012) - [i31]Daniel J. Bernstein, Tanja Lange:
Non-uniform cracks in the concrete: the power of free precomputation. IACR Cryptol. ePrint Arch. 2012: 318 (2012) - [i30]Jean-Philippe Aumasson, Daniel J. Bernstein:
SipHash: a fast short-input PRF. IACR Cryptol. ePrint Arch. 2012: 351 (2012) - [i29]Daniel J. Bernstein, Tanja Lange:
Never trust a bunny. IACR Cryptol. ePrint Arch. 2012: 355 (2012) - [i28]Daniel J. Bernstein, Tanja Lange:
Computing small discrete logarithms faster. IACR Cryptol. ePrint Arch. 2012: 458 (2012) - [i27]Daniel J. Bernstein, Jeroen Doumen, Tanja Lange, Jan-Jaap Oosterwijk:
Faster batch forgery identification. IACR Cryptol. ePrint Arch. 2012: 549 (2012) - 2011
- [c34]Daniel J. Bernstein, Tanja Lange, Christiane Peters, Peter Schwabe:
Really Fast Syndrome-Based Hashing. AFRICACRYPT 2011: 134-152 - [c33]Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, Bo-Yin Yang:
High-Speed High-Security Signatures. CHES 2011: 124-142 - [c32]Daniel J. Bernstein:
List Decoding for Binary Goppa Codes. IWCC 2011: 62-80 - [c31]Daniel J. Bernstein, Tanja Lange, Christiane Peters, Peter Schwabe:
Faster 2-Regular Information-Set Decoding. IWCC 2011: 81-98 - [c30]Daniel J. Bernstein, Tanja Lange, Christiane Peters:
Smaller Decoding Exponents: Ball-Collision Decoding. CRYPTO 2011: 743-760 - [c29]Daniel J. Bernstein, Tanja Lange, Peter Schwabe:
On the Correct Use of the Negation Map in the Pollard rho Method. Public Key Cryptography 2011: 128-146 - [c28]Daniel J. Bernstein:
Simplified High-Speed High-Distance List Decoding for Alternant Codes. PQCrypto 2011: 200-216 - [c27]Daniel J. Bernstein, Tanja Lange, Christiane Peters:
Wild McEliece Incognito. PQCrypto 2011: 244-254 - [e2]Daniel J. Bernstein, Sanjit Chatterjee:
Progress in Cryptology - INDOCRYPT 2011 - 12th International Conference on Cryptology in India, Chennai, India, December 11-14, 2011. Proceedings. Lecture Notes in Computer Science 7107, Springer 2011, ISBN 978-3-642-25577-9 [contents] - [r2]Daniel J. Bernstein:
Factorization Circuits. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 444-445 - [r1]Daniel J. Bernstein:
Post-Quantum Cryptography. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 949-950 - [i26]Daniel J. Bernstein, Tanja Lange, Peter Schwabe:
On the correct use of the negation map in the Pollard rho method. IACR Cryptol. ePrint Arch. 2011: 3 (2011) - [i25]Daniel J. Bernstein, Tanja Lange, Christiane Peters, Peter Schwabe:
Really fast syndrome-based hashing. IACR Cryptol. ePrint Arch. 2011: 74 (2011) - [i24]Daniel J. Bernstein, Tanja Lange, Christiane Peters, Peter Schwabe:
Faster 2-regular information-set decoding. IACR Cryptol. ePrint Arch. 2011: 120 (2011) - [i23]Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, Bo-Yin Yang:
High-speed high-security signatures. IACR Cryptol. ePrint Arch. 2011: 368 (2011) - [i22]Daniel J. Bernstein, Tanja Lange, Christiane Peters:
Wild McEliece Incognito. IACR Cryptol. ePrint Arch. 2011: 502 (2011) - [i21]Daniel J. Bernstein, Tanja Lange, Peter Schwabe:
The security impact of a new cryptographic library. IACR Cryptol. ePrint Arch. 2011: 646 (2011) - 2010
- [c26]Daniel J. Bernstein, Hsieh-Chung Chen, Chen-Mou Cheng, Tanja Lange, Ruben Niederhagen, Peter Schwabe, Bo-Yin Yang:
ECC2K-130 on NVIDIA GPUs. INDOCRYPT 2010: 328-346 - [c25]Daniel J. Bernstein, Peter Birkner, Tanja Lange:
Starfish on Strike. LATINCRYPT 2010: 61-80 - [c24]Daniel J. Bernstein:
Grover vs. McEliece. PQCrypto 2010: 73-80 - [c23]Daniel J. Bernstein, Tanja Lange, Christiane Peters:
Wild McEliece. Selected Areas in Cryptography 2010: 143-158 - [c22]Daniel J. Bernstein, Tanja Lange:
Type-II Optimal Polynomial Bases. WAIFI 2010: 41-61 - [e1]Daniel J. Bernstein, Tanja Lange:
Progress in Cryptology - AFRICACRYPT 2010, Third International Conference on Cryptology in Africa, Stellenbosch, South Africa, May 3-6, 2010. Proceedings. Lecture Notes in Computer Science 6055, Springer 2010, ISBN 978-3-642-12677-2 [contents] - [i20]Daniel J. Bernstein, Tanja Lange:
Type-II Optimal Polynomial Bases. IACR Cryptol. ePrint Arch. 2010: 69 (2010) - [i19]Daniel J. Bernstein, Peter Birkner, Tanja Lange:
Starfish on Strike. IACR Cryptol. ePrint Arch. 2010: 367 (2010) - [i18]Daniel J. Bernstein, Tanja Lange, Christiane Peters:
Wild McEliece. IACR Cryptol. ePrint Arch. 2010: 410 (2010) - [i17]Daniel J. Bernstein, Tanja Lange, Christiane Peters:
Smaller decoding exponents: ball-collision decoding. IACR Cryptol. ePrint Arch. 2010: 585 (2010) - [i16]Daniel J. Bernstein, Tanja Lange:
Cryptanalysis of Skein. IACR Cryptol. ePrint Arch. 2010: 623 (2010)
2000 – 2009
- 2009
- [c21]Daniel J. Bernstein:
Batch Binary Edwards. CRYPTO 2009: 317-336 - [c20]Daniel J. Bernstein, Tien-Ren Chen, Chen-Mou Cheng, Tanja Lange, Bo-Yin Yang:
ECM on Graphics Cards. EUROCRYPT 2009: 483-501 - [c19]Daniel J. Bernstein, Tanja Lange, Ruben Niederhagen, Christiane Peters, Peter Schwabe:
FSBday. INDOCRYPT 2009: 18-38 - [c18]Endre Bangerter, Manuel Barbosa
, Daniel J. Bernstein, Ivan Damgård, Daniel Page, Jakob Illeborg Pagter, Ahmad-Reza Sadeghi, Sampo Sovio:
Using Compilers to Enhance Cryptographic Product Development. ISSE 2009: 291-301 - [c17]Daniel J. Bernstein:
Breaking DNSSEC. WOOT 2009 - [i15]Daniel J. Bernstein, Tanja Lange, Ruben Niederhagen, Christiane Peters, Peter Schwabe:
Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB. IACR Cryptol. ePrint Arch. 2009: 292 (2009) - [i14]Daniel V. Bailey, Brian Baldwin, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Gauthier Van Damme, Giacomo de Meulenaer, Junfeng Fan, Tim Güneysu, Frank K. Gürkaynak, Thorsten Kleinjung, Tanja Lange, Nele Mentens, Christof Paar, Francesco Regazzoni, Peter Schwabe, Leif Uhsadel:
The Certicom Challenges ECC2-X. IACR Cryptol. ePrint Arch. 2009: 466 (2009) - [i13]Daniel V. Bailey, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Hsieh-Chung Chen, Chen-Mou Cheng, Gauthier Van Damme, Giacomo de Meulenaer, Luis J. Dominguez Perez, Junfeng Fan, Tim Güneysu, Frank K. Gürkaynak, Thorsten Kleinjung, Tanja Lange, Nele Mentens, Ruben Niederhagen, Christof Paar, Francesco Regazzoni, Peter Schwabe, Leif Uhsadel, Anthony Van Herrewege, Bo-Yin Yang:
Breaking ECC2K-130. IACR Cryptol. ePrint Arch. 2009: 541 (2009) - [i12]Daniel J. Bernstein, Tanja Lange:
A complete set of addition laws for incomplete Edwards curves. IACR Cryptol. ePrint Arch. 2009: 580 (2009) - 2008
- [c16]Daniel J. Bernstein, Peter Birkner, Marc Joye, Tanja Lange, Christiane Peters:
Twisted Edwards Curves. AFRICACRYPT 2008: 389-405 - [c15]Daniel J. Bernstein, Tanja Lange, Reza Rezaeian Farashahi
:
Binary Edwards Curves. CHES 2008: 244-265 - [c14]Daniel J. Bernstein:
Proving Tight Security for Rabin-Williams Signatures. EUROCRYPT 2008: 70-87 - [c13]Daniel J. Bernstein, Peter Schwabe:
New AES Software Speed Records. INDOCRYPT 2008: 322-336 - [c12]Daniel J. Bernstein, Tanja Lange, Christiane Peters:
Attacking and Defending the McEliece Cryptosystem. PQCrypto 2008: 31-46 - [p1]Daniel J. Bernstein:
The Salsa20 Family of Stream Ciphers. The eSTREAM Finalists 2008: 84-97 - [i11]Daniel J. Bernstein, Peter Birkner, Marc Joye, Tanja Lange, Christiane Peters:
Twisted Edwards Curves. IACR Cryptol. ePrint Arch. 2008: 13 (2008) - [i10]Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters:
ECM using Edwards curves. IACR Cryptol. ePrint Arch. 2008: 16 (2008) - [i9]Daniel J. Bernstein, Tanja Lange, Reza Rezaeian Farashahi:
Binary Edwards Curves. IACR Cryptol. ePrint Arch. 2008: 171 (2008) - [i8]Daniel J. Bernstein, Tanja Lange, Christiane Peters:
Attacking and defending the McEliece cryptosystem. IACR Cryptol. ePrint Arch. 2008: 318 (2008) - [i7]Daniel J. Bernstein, Peter Schwabe:
New AES software speed records. IACR Cryptol. ePrint Arch. 2008: 381 (2008) - [i6]Daniel J. Bernstein, Tien-Ren Chen, Chen-Mou Cheng, Tanja Lange, Bo-Yin Yang:
ECM on Graphics Cards. IACR Cryptol. ePrint Arch. 2008: 480 (2008) - 2007
- [j9]Daniel J. Bernstein, Hendrik W. Lenstra Jr., Jonathan Pila:
Detecting perfect powers by factoring into coprimes. Math. Comput. 76(257): 385-388 (2007) - [j8]Daniel J. Bernstein:
Proving primality in essentially quartic random time. Math. Comput. 76(257): 389-403 (2007) - [j7]Daniel J. Bernstein, Jonathan P. Sorenson
:
Modular exponentiation via the explicit Chinese remainder theorem. Math. Comput. 76(257): 443-454 (2007) - [c11]Daniel J. Bernstein, Tanja Lange:
Inverted Edwards Coordinates. AAECC 2007: 20-27 - [c10]Daniel J. Bernstein:
The Tangent FFT. AAECC 2007: 291-300 - [c9]Daniel J. Bernstein, Tanja Lange:
Faster Addition and Doubling on Elliptic Curves. ASIACRYPT 2007: 29-50 - [c8]Daniel J. Bernstein:
Some thoughts on security after ten years of qmail 1.0. CSAW 2007: 1-10 - [c7]Bo-Yin Yang, Chia-Hsin Owen Chen, Daniel J. Bernstein, Jiun-Ming Chen:
Analysis of QUAD. FSE 2007: 290-308 - [c6]Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters:
Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication. INDOCRYPT 2007: 167-182 - [i5]Daniel J. Bernstein, Tanja Lange:
Faster addition and doubling on elliptic curves. IACR Cryptol. ePrint Arch. 2007: 286 (2007) - [i4]Daniel J. Bernstein, Tanja Lange:
Inverted Edwards coordinates. IACR Cryptol. ePrint Arch. 2007: 410 (2007) - [i3]Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters:
Optimizing double-base elliptic-curve single-scalar multiplication. IACR Cryptol. ePrint Arch. 2007: 414 (2007) - [i2]Daniel J. Bernstein, Tanja Lange:
Analysis and optimization of elliptic-curve single-scalar multiplication. IACR Cryptol. ePrint Arch. 2007: 455 (2007) - 2006
- [c5]Daniel J. Bernstein:
Curve25519: New Diffie-Hellman Speed Records. Public Key Cryptography 2006: 207-228 - 2005
- [j6]Daniel J. Bernstein:
Factoring into coprimes in essentially linear time. J. Algorithms 54(1): 1-30 (2005) - [c4]Daniel J. Bernstein:
Stronger Security Bounds for Wegman-Carter-Shoup Authenticators. EUROCRYPT 2005: 164-180 - [c3]Daniel J. Bernstein:
The Poly1305-AES Message-Authentication Code. FSE 2005: 32-49 - 2004
- [j5]A. O. L. Atkin, Daniel J. Bernstein:
Prime sieves using binary quadratic forms. Math. Comput. 73(246): 1023-1030 (2004) - 2001
- [j4]Daniel J. Bernstein:
Enumerating solutions to p(a) + q(b) = r(c) + s(d). Math. Comput. 70(233): 389-394 (2001)
1990 – 1999
- 1999
- [j3]Daniel J. Bernstein:
How to Stretch Random Functions: The Security of Protected Counter Sums. J. Cryptol. 12(3): 185-192 (1999) - 1998
- [j2]Daniel J. Bernstein:
Composing Power Series Over a Finite Ring in Essentially Linear Time. J. Symb. Comput. 26(3): 339-341 (1998) - [j1]Daniel J. Bernstein:
Detecting perfect powers in essentially linear time. Math. Comput. 67(223): 1253-1283 (1998) - [c2]Daniel J. Bernstein:
Bounding Smooth Integers. ANTS 1998: 128-130 - 1996
- [c1]Daniel J. Bernstein:
Fast Ideal Artithmetic via Lazy Localization. ANTS 1996: 27-34 - 1990
- [i1]Daniel J. Bernstein:
The Q Method of Implementing TELNET Option Negotiation. RFC 1143: 1-10 (1990)
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-03 23:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint