Stop the war!
Остановите войну!
for scientists:
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
showing all ?? records
2020 – today
- 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 - [i104]Daniel J. Bernstein:
Asymptotics for the standard block size in primal lattice attacks: second order, formally verified. IACR Cryptol. ePrint Arch. 2024: 592 (2024) - [i103]Daniel J. Bernstein, Jolijn Cottaar, Tanja Lange:
Searching for differential addition chains. IACR Cryptol. ePrint Arch. 2024: 1044 (2024) - [i102]Daniel J. Bernstein, Karthikeyan Bhargavan, Shivam Bhasin, Anupam Chattopadhyay, Tee Kiah Chia, Matthias J. Kannwischer, Franziskus Kiefer, Thales Paiva, Prasanna Ravi, Goutam Tamvada:
KyberSlash: Exploiting secret-dependent division timings in Kyber implementations. IACR Cryptol. ePrint Arch. 2024: 1049 (2024) - [i101]Daniel J. Bernstein, Tanja Lange:
Safe curves for elliptic-curve cryptography. IACR Cryptol. ePrint Arch. 2024: 1265 (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]