D. Bernstein

发表

DISTINGUISHING PRIME NUMBERS FROM COMPOSITE NUMBERS

D. Bernstein, 2022 .

A short proof of the unpredictability of cipher block chaining

D. Bernstein, .

High-speed high-security signatures

Tanja Lange, Peter Schwabe, Bo-Yin Yang, 2011, Journal of Cryptographic Engineering.

HOW TO FIND SMOOTH PARTS OF INTEGERS

D. Bernstein, 2004 .

RSA signatures and Rabin – Williams signatures : the state of the art

D. Bernstein, 2008 .

What output size resists collisions in a xor of independent expansions ?

D. Bernstein, 2007 .

Optimizing linear maps modulo 2

D. Bernstein, 2009 .

Twisted Hessian Curves

Tanja Lange, Daniel J. Bernstein, Chitchanok Chuengsatiansup, 2015, LATINCRYPT.

Differential addition chains

D. Bernstein, 2006 .

Enumerating and Counting Smooth Integers

D. Bernstein, 1995 .

The Certicom Challenges ECC 2X

Joppe W. Bos, C. Paar, T. Güneysu, 2017 .

Post-quantum cryptography

D. Bernstein, T. Lange, 2008, Nature.

HOW TO FIND SMALL FACTORS OF INTEGERS

D. Bernstein, 2000 .

Better price-performance ratios for generalized birthday attacks

D. Bernstein, 2007 .

Which phase-3 eSTREAM ciphers provide the best software speeds ?

D. Bernstein, 2008 .

SPHINCS + Submission to the NIST post-quantum project

Scott R. Fluhrer, Martin M. Lauridsen, D. Bernstein, 2017 .

Cost analysis of hash collisions : will quantum computers make SHARCS obsolete?

D. Bernstein, 2009 .

Comparison of 256-bit stream ciphers

D. Bernstein, 2006 .

The billion-mulmod-per-second PC

Chen, Chen-Mou Cheng, Bo-Yin Yang, 2009 .

Curve-Based Cryptography

Tim, Joppe W. Bos, Christine Abegail Antonio, 2017 .

Asymptotically faster quantum algorithms to solve multivariate quadratic equations

Bo-Yin Yang, Daniel J. Bernstein, D. Bernstein, 2018, IACR Cryptol. ePrint Arch..

Computational aspects of Commutative Algebra and Algebraic Geometry

D. Bernstein, 2008 .

ANTS X Proceedings of the Tenth Algorithmic Number Theory Symposium msp Two grumpy giants and a baby

D. Bernstein, T. Lange, 2013 .

Divergence bounds for random fixed-weight vectors obtained by sorting

D. Bernstein, 2017 .

Quantum circuits for the CSIDH

D. Bernstein, T. Lange, C. Martindale, 2019 .

Initial recommendations of long-term secure post-quantum systems

Joppe W. Bos, S. Gueron, T. Güneysu, 2015 .

Fast Ideal Artithmetic via Lazy Localization

Daniel J. Bernstein, D. Bernstein, 1996, ANTS.

Failures in NIST ’ s ECC standards

D. Bernstein, T. Lange, 2015 .

MULTIDIGIT MULTIPLICATION FOR MATHEMATICIANS

D. Bernstein, 2022 .

Understanding brute force

D. Bernstein, 2005 .

Extending the Salsa 20 nonce

D. Bernstein, 2008 .

Breaking ECC 2 K-130

Frank K. Gürkaynak, Joppe W. Bos, C. Paar, 2017 .

Contemporary Mathematics Polynomial evaluation and message authentication

D. Bernstein, 2007 .

Cycle counts for authenticated encryption

D. Bernstein, 2007 .

Proving Primality In Essentially Quartic Expected Time

D. Bernstein, 2003 .

Which phase-3 eSTREAM ciphers provide the best software speeds ?

D. Bernstein, 2008 .

Comparison of 256-bit stream ciphers at the beginning of 2006

D. Bernstein, 2006 .

Addition formulas for elliptic curves

Tanja Lange, Daniel J. Bernstein, D. Bernstein, 2013, Handbook of Finite Fields.

SPHINCS+ - Submission to the NIST post-quantum cryptography project

Tanja Lange, Peter Schwabe, Florian Mendel, 2017 .

Public-Key Authenticated Encryption

Qijun Gu, Tor Helleseth, Kazue Sako, 2011, Encyclopedia of Cryptography and Security.

A one-time single-bit fault leaks all previous NTRU-HRSS session keys to a chosen-ciphertext attack

D. Bernstein, 2022 .

The SPHINCS + Signature Framework Full version , September 23 , 2019

D. Bernstein, Andreas Hülsing, R. Niederhagen, 2019 .

A 3D Finite Element Solver for the Initial Value Problem

M. Holst, D. Bernstein, 1998 .

Fast norm computation in smooth-degree Abelian number fields

D. Bernstein, 2023, Research in Number Theory.

How to manipulate curve standards

D. Bernstein, T. Lange, Andreas Hülsing, 2015 .

VIA THE EXPLICIT CHINESE REMAINDER THEOREM

D. Bernstein, Jonathan P. Sorenson, 2006 .

Circuits for Integer Factorization: A Proposal

Daniel J. Bernstein, D. Bernstein, 2001 .

Curve 41417 : Karatsuba Revisited

D. Bernstein, T. Lange, C. Chuengsatiansup, 2014 .

Fast Ideal Artithmetic via Lazy Localization

D. Bernstein, 1996, ANTS.

Draft. Aimed at Mathemati s of Computation. FASTER SQUARE ROOTS IN ANNOYING FINITE FIELDS

D. Bernstein, DANIEL J. BERNSTEIN, 2007 .

Factoring RSA keys from certified smart cards: Coppersmith in the wild

Tanja Lange, Chen-Mou Cheng, Daniel J. Bernstein, 2013, IACR Cryptol. ePrint Arch..

Detecting perfect powers in essentially linear time

Daniel J. Bernstein, D. Bernstein, 1998, Math. Comput..

Grover vs. McEliece

Daniel J. Bernstein, D. Bernstein, 2010, PQCrypto.

Verified fast formulas for control bits for permutation networks

Daniel J. Bernstein, D. Bernstein, 2020, IACR Cryptol. ePrint Arch..

McBits: Fast Constant-Time Code-Based Cryptography

Peter Schwabe, Daniel J. Bernstein, Tung Chou, 2013, CHES.

On the Practical Exploitability of Dual EC in TLS Implementations

Tanja Lange, Hovav Shacham, Matthew Green, 2014, USENIX Security Symposium.

NTRU Prime: Reducing Attack Surface at Low Cost

Tanja Lange, Daniel J. Bernstein, Christine van Vredendaal, 2017, SAC.

Introduction to post-quantum cryptography

Daniel J. Bernstein, D. Bernstein, 2009 .

Type-II Optimal Polynomial Bases

Tanja Lange, Daniel J. Bernstein, D. Bernstein, 2010, WAIFI.

On the Security of RC4 in TLS

Kenneth G. Paterson, Jacob C. N. Schuldt, Daniel J. Bernstein, 2013, USENIX Security Symposium.

Enumerating solutions to p(a) + q(b) = r(c) + s(d)

Daniel J. Bernstein, D. Bernstein, 2001, Math. Comput..

Two grumpy giants and a baby

Tanja Lange, Daniel J. Bernstein, D. Bernstein, 2013, IACR Cryptol. ePrint Arch..

Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies

Tanja Lange, Daniel J. Bernstein, Lorenz Panny, 2019, IACR Cryptol. ePrint Arch..

Faster computation of isogenies of large prime degree pdf

Benjamin A. Smith, Antonin Leroux, Benjamin Smith, 2020, IACR Cryptol. ePrint Arch..

Factoring into coprimes in essentially linear time

Daniel J. Bernstein, D. Bernstein, 2005, J. Algorithms.

Curve25519: New Diffie-Hellman Speed Records

Daniel J. Bernstein, D. Bernstein, 2006, Public Key Cryptography.

Dual EC: A Standardized Back Door

Tanja Lange, Daniel J. Bernstein, Ruben Niederhagen, 2015, The New Codebreakers.

The Tangent FFT

Daniel J. Bernstein, D. Bernstein, 2007, AAECC.

EdDSA for more curves

Tanja Lange, Peter Schwabe, Bo-Yin Yang, 2015, IACR Cryptol. ePrint Arch..

Kummer Strikes Back: New DH Speed Records

Tanja Lange, Peter Schwabe, Daniel J. Bernstein, 2014, ASIACRYPT.

Curve41417: Karatsuba revisited

Tanja Lange, Daniel J. Bernstein, Chitchanok Chuengsatiansup, 2014, IACR Cryptol. ePrint Arch..

The Poly1305-AES Message-Authentication Code

Daniel J. Bernstein, D. Bernstein, 2005, FSE.

The 3x + 1 Conjugacy Map

D. Bernstein, Jeffrey C. Lagarias, 1996, Canadian Journal of Mathematics - Journal Canadien de Mathematiques.

Prime sieves using binary quadratic forms

Daniel J. Bernstein, A. O. L. Atkin, A. Atkin, 2003, Math. Comput..

SipHash: A Fast Short-Input PRF

Jean-Philippe Aumasson, Daniel J. Bernstein, Jean-Philippe Aumasson, 2012, INDOCRYPT.

Sliding Right into Disaster: Left-to-Right Sliding Windows Leak

Tanja Lange, Yuval Yarom, Daniel J. Bernstein, 2017, CHES.

Cache-timing attacks on AES

Daniel J. Bernstein, D. Bernstein, 2005 .

Montgomery curves and the Montgomery ladder

Tanja Lange, Daniel J. Bernstein, D. Bernstein, 2017, IACR Cryptol. ePrint Arch..

Concrete quantum cryptanalysis of binary elliptic curves

Daniel J. Bernstein, Gustavo Banegas, Tanja Lange, 2020, IACR Cryptol. ePrint Arch..

The Certicom Challenges ECC2-X

Tanja Lange, Peter Schwabe, Tim Güneysu, 2009, IACR Cryptol. ePrint Arch..

conservative code-based cryptography

Daniel J. Bernstein, D. Bernstein, 2017 .

The SPHINCS+ Signature Framework

Peter Schwabe, Stefan Kölbl, Daniel J. Bernstein, 2019, IACR Cryptol. ePrint Arch..

ECM using Edwards curves

Tanja Lange, Daniel J. Bernstein, Peter Birkner, 2012, Math. Comput..

Batch Binary Edwards

Daniel J. Bernstein, D. Bernstein, 2009, CRYPTO.

Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication

Tanja Lange, Daniel J. Bernstein, Peter Birkner, 2007, INDOCRYPT.

Faster Addition and Doubling on Elliptic Curves

Tanja Lange, Daniel J. Bernstein, D. Bernstein, 2007, ASIACRYPT.

COMPUTING LOGARITHM INTERVALS WITH THE ARITHMETIC-GEOMETRIC-MEAN ITERATION

D. Bernstein, 2022 .

The Security Impact of a New Cryptographic Library

Tanja Lange, Peter Schwabe, Daniel J. Bernstein, 2012, LATINCRYPT.

Attacking and defending the McEliece cryptosystem

Tanja Lange, Daniel J. Bernstein, Christiane Peters, 2008, IACR Cryptol. ePrint Arch..

Simplified High-Speed High-Distance List Decoding for Alternant Codes

Daniel J. Bernstein, D. Bernstein, 2011, PQCrypto.

Binary Edwards Curves

Tanja Lange, Reza Rezaeian Farashahi, Daniel J. Bernstein, 2008, CHES.

Twisted Edwards Curves

Tanja Lange, Marc Joye, Daniel J. Bernstein, 2008, AFRICACRYPT.

Inverted Edwards Coordinates

Tanja Lange, Daniel J. Bernstein, D. Bernstein, 2007, AAECC.

Investigating SRAM PUFs in large CPUs and GPUs pdf

Daniel J. Bernstein, Ruben Niederhagen, Pol Van Aubel, 2015, SPACE.

Gimli : A Cross-Platform Permutation

Yosuke Todo, Peter Schwabe, Florian Mendel, 2017, CHES.

Stronger Security Bounds for Wegman-Carter-Shoup Authenticators

Daniel J. Bernstein, D. Bernstein, 2005, EUROCRYPT.

How to Stretch Random Functions: The Security of Protected Counter Sums

Daniel J. Bernstein, D. Bernstein, 1999, Journal of Cryptology.

Pippenger's Exponentiation Algorithm

Daniel J. Bernstein, Daniel J. Bernstein, D. Bernstein, 2002 .

New AES Software Speed Records

Peter Schwabe, Daniel J. Bernstein, D. Bernstein, 2008, INDOCRYPT.

The Salsa20 Family of Stream Ciphers

Daniel J. Bernstein, D. Bernstein, 2008, The eSTREAM Finalists.

TweetNaCl: A Crypto Library in 100 Tweets

Tanja Lange, Peter Schwabe, Daniel J. Bernstein, 2014, LATINCRYPT.

Elligator: elliptic-curve points indistinguishable from uniform random strings

Daniel J. Bernstein, Tanja Lange, Anna Krasnova, 2013, IACR Cryptol. ePrint Arch..

Detecting perfect powers by factoring into coprimes

Daniel J. Bernstein, Hendrik W. Lenstra, Jonathan Pila, 2007, Math. Comput..

SPHINCS: Practical Stateless Hash-Based Signatures

Peter Schwabe, Daniel J. Bernstein, Daira Hopwood, 2015, EUROCRYPT.

Batch NFS

Tanja Lange, Daniel J. Bernstein, D. Bernstein, 2014, IACR Cryptol. ePrint Arch..

Short Generators Without Quantum Computers: The Case of Multiquadratics

Tanja Lange, Daniel J. Bernstein, Christine van Vredendaal, 2017, EUROCRYPT.

A complete set of addition laws for incomplete Edwards curves

Tanja Lange, Daniel J. Bernstein, D. Bernstein, 2011, IACR Cryptol. ePrint Arch..

Can we avoid tests for zero in fast elliptic-curve arithmetic ?

Daniel J. Bernstein, D. Bernstein, 2006 .

Integer factorization

D. Bernstein, 2005 .

Comparing proofs of security for lattice-based encryption

Daniel J. Bernstein, D. Bernstein, 2019, IACR Cryptol. ePrint Arch..

McTiny: fast high-confidence post-quantum key erasure for tiny network servers

Daniel J. Bernstein, Tanja Lange, D. Bernstein, 2019, IACR Cryptol. ePrint Arch..

Fast constant-time gcd computation and modular inversion

Bo-Yin Yang, Daniel J. Bernstein, D. Bernstein, 2019, IACR Cryptol. ePrint Arch..

CTIDH: faster constant-time CSIDH

Tanja Lange, Daniel J. Bernstein, Jana Sotáková, 2021, IACR Cryptol. ePrint Arch..

OpenSSLNTRU: Faster post-quantum TLS key exchange

Billy Bob Brumley, Daniel J. Bernstein, Ming-Shing Chen, 2021, IACR Cryptol. ePrint Arch..

NTRU Prime

Tanja Lange, Daniel J. Bernstein, Christine van Vredendaal, 2016, IACR Cryptol. ePrint Arch..

MinimaLT: minimal-latency networking through better security

Tanja Lange, Xu Zhang, Daniel J. Bernstein, 2013, IACR Cryptol. ePrint Arch..

Tighter, faster, simpler side-channel security evaluations beyond computing power

Tanja Lange, Daniel J. Bernstein, Christine van Vredendaal, 2015, IACR Cryptol. ePrint Arch..

Smaller decoding exponents: ball-collision decoding

Tanja Lange, Daniel J. Bernstein, Christiane Peters, 2011, IACR Cryptol. ePrint Arch..

Some thoughts on security after ten years of qmail 1.0

Daniel J. Bernstein, D. Bernstein, 2007, CSAW '07.

Multidigit Modular Multiplication With The Explicit Chinese Remainder Theorem

Daniel J. Bernstein, D. Bernstein, 1995 .

Modular exponentiation via the explicit Chinese remainder theorem

Daniel J. Bernstein, Jonathan P. Sorenson, J. Sorenson, 2007, Math. Comput..

Hash-Function Based PRFs: AMAC and Its Multi-User Security

Mihir Bellare, Stefano Tessaro, Daniel J. Bernstein, 2016, EUROCRYPT.

Explicit bounds for generic decoding algorithms for code-based cryptography

Daniel J. Bernstein, van Hca Henk Tilborg, Tanja Lange, 2009 .

Faster 2-Regular Information-Set Decoding

Tanja Lange, Peter Schwabe, Daniel J. Bernstein, 2011, IWCC.

CryptAttackTester: formalizing attack analyses

D. Bernstein, T. Chou, 2023, IACR Cryptol. ePrint Arch..

Ball-collision decoding

Daniel J. Bernstein, Tanja Lange, Christiane Peters, 2010 .

Analysis of QUAD

Bo-Yin Yang, Chia-Hsin Owen Chen, Daniel J. Bernstein, 2007, FSE.

Quantum Algorithms for the Subset-Sum Problem

Tanja Lange, Stacey Jeffery, Daniel J. Bernstein, 2013, PQCrypto.

Quantum attacks against Blue Midnight Wish, ECHO, Fugue, Grstl, Hamsi, JH, Keccak, Shabal, SHAvite-3, SIMD, and Skein

Daniel J. Bernstein, D. Bernstein, 2010 .

Initial recommendations of long-term secure post-quantum systems

Joppe W. Bos, S. Gueron, T. Güneysu, 2015 .

On the Security of RC4 in TLS and WPA

Kenneth G. Paterson, Daniel J. Bernstein, Bertram Poettering, 2013 .

Faster Batch Forgery Identification

Tanja Lange, Jeroen Doumen, Daniel J. Bernstein, 2012, INDOCRYPT.

Post-quantum cryptography

Tanja Lange, Daniel J. Bernstein, D. Bernstein, 2008, Nature.

Analysis and optimization of elliptic-curve single-scalar multiplication

Tanja Lange, Daniel J. Bernstein, D. Bernstein, 2007, IACR Cryptol. ePrint Arch..

HILA5 Pindakaas: On the CCA security of lattice-based encryption with error correction

Tanja Lange, Daniel J. Bernstein, Leon Groot Bruinderink, 2018, IACR Cryptol. ePrint Arch..

On the Security of RC4 in TLS and WPA

Nadhem J. AlFardan, K. Paterson, Bertram Poettering, 2013 .

FSBday

D. Bernstein, T. Lange, P. Schwabe, 2009, INDOCRYPT.

Under surveillance

Joppe W. Bos, C. Paar, M. Naehrig, 2005, Nature Biotechnology.

Bounding Smooth Integers

Daniel J. Bernstein, D. Bernstein, 1998, ANTS.

fast constant-time code-based cryptography

Peter Schwabe, Daniel J. Bernstein, Tung Chou, 2013 .

ECM on Graphics Cards

Tanja Lange, Chen-Mou Cheng, Bo-Yin Yang, 2009, IACR Cryptol. ePrint Arch..

Multi-ciphertext security degradation for lattices

D. Bernstein, 2022, IACR Cryptol. ePrint Arch..

On the looseness of FO derandomization

Daniel J. Bernstein, D. Bernstein, 2021, IACR Cryptol. ePrint Arch..

DISTINGUISHING PRIME NUMBERS FROM COMPOSITE NUMBERS : THE STATE OF THE ART IN 2004

D. Bernstein, 2013 .

Faster Binary-Field Multiplication and Faster Binary-Field MACs

Daniel J. Bernstein, Tung Chou, D. Bernstein, 2014, IACR Cryptol. ePrint Arch..

Breaking ECC2K-130

Tanja Lange, Peter Schwabe, Tim Güneysu, 2009, IACR Cryptol. ePrint Arch..

Optimizing linear maps modulo 2

D. Bernstein, 2009 .

NTRU Prime: Reducing Attack Surface at Low Cost

D. Bernstein, T. Lange, C. Chuengsatiansup, 2017, SAC.

Low-Communication Parallel Quantum Multi-Target Preimage Search

Daniel J. Bernstein, Gustavo Banegas, D. Bernstein, 2017, SAC.

A Low-Resource Quantum Factoring Algorithm

Daniel J. Bernstein, Michele Mosca, Jean-François Biasse, 2017, PQCrypto.

Proving primality in essentially quartic random time

Daniel J. Bernstein, D. Bernstein, 2007, Math. Comput..

Cryptographic Competitions

Daniel J. Bernstein, D. Bernstein, 2023, Journal of Cryptology.

Post-quantum RSA

Daniel J. Bernstein, Nadia Heninger, Paul Lou, 2017, PQCrypto.

FASTER SQUARE ROOTS IN ANNOYING FINITE FIELDS

D. Bernstein, 2022 .

Status Report on the Second Round of the SHA-3 Cryptographic Hash Algorithm Competition

John Kelsey, William E. Burr, Elaine B. Barker, 2011 .

FLOATING-POINT ARITHMETIC AND MESSAGE AUTHENTICATION

Daniel J. Bernstein, D. Bernstein, 2000 .

A Secure Public-Key Signature System With Extremely Fast Verification

Daniel J. Bernstein, D. Bernstein, 2000 .

Wild McEliece

Tanja Lange, Daniel J. Bernstein, Christiane Peters, 2010, IACR Cryptol. ePrint Arch..

Understanding binary-Goppa decoding

D. Bernstein, 2024, IACR Cryptol. ePrint Arch..

How to manipulate curve standards: a white paper for the black hat

Daniel J. Bernstein, Andreas Hülsing, Tanja Lange, 2014, IACR Cryptol. ePrint Arch..

High-speed high-security signatures

D. Bernstein, T. Lange, N. Duif, 2011, Journal of Cryptographic Engineering.

Non-randomness of S-unit lattices

Tanja Lange, Daniel J. Bernstein, D. Bernstein, 2021, IACR Cryptol. ePrint Arch..

BasicBlocker: Redesigning ISAs to Eliminate Speculative-Execution Attacks pdf

Tim Güneysu, Daniel J. Bernstein, Markus Krausz, 2020, ArXiv.

Efficient point-counting on genus-2 hyperelliptic curves

Daniel J. Bernstein, D. Bernstein, Nicole Pitcher, 2009 .

Differential addition chains

D. Bernstein, 2006 .

Computing Small Discrete Logarithms Faster

Tanja Lange, Daniel J. Bernstein, D. Bernstein, 2012, INDOCRYPT.