The following pages link to Daniel J. Bernstein (Q819872):
Displayed 50 items.
- Sharper \(ABC\)-based bounds for congruent polynomials (Q819873) (← links)
- Composing power series over a finite ring in essentially linear time (Q1267071) (← links)
- How to stretch random functions: The security of protected counter sums (Q1304976) (← links)
- Asymptotically faster quantum algorithms to solve multivariate quadratic equations (Q1644796) (← links)
- HILA5 pindakaas: on the CCA security of lattice-based encryption with error correction (Q1653237) (← links)
- Post-quantum RSA (Q1673617) (← links)
- A low-resource quantum factoring algorithm (Q1673618) (← links)
- NTRU prime: reducing attack surface at low cost (Q1746970) (← links)
- Low-communication parallel quantum multi-target preimage search (Q1746977) (← links)
- Decisional second-preimage resistance: when does SPR imply PRE? (Q2178847) (← links)
- Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies (Q2292880) (← links)
- A complete set of addition laws for incomplete Edwards curves (Q2430986) (← links)
- Batch NFS (Q2798603) (← links)
- Faster Binary-Field Multiplication and Faster Binary-Field MACs (Q2798606) (← links)
- Dual EC: A Standardized Back Door (Q2803634) (← links)
- Hash-Function Based PRFs: AMAC and Its Multi-User Security (Q2820497) (← links)
- McBits: Fast Constant-Time Code-Based Cryptography (Q2851419) (← links)
- Never Trust a Bunny (Q2858118) (← links)
- Non-uniform Cracks in the Concrete: The Power of Free Precomputation (Q2867160) (← links)
- Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild (Q2867164) (← links)
- Computing Small Discrete Logarithms Faster (Q2876940) (← links)
- Faster Batch Forgery Identification (Q2876952) (← links)
- SipHash: A Fast Short-Input PRF (Q2876955) (← links)
- Hyper-and-elliptic-curve cryptography (Q2878835) (← links)
- The Security Impact of a New Cryptographic Library (Q2915120) (← links)
- Kummer Strikes Back: New DH Speed Records (Q2938852) (← links)
- Twisted Hessian Curves (Q2946454) (← links)
- TweetNaCl: A Crypto Library in 100 Tweets (Q2946467) (← links)
- SPHINCS: Practical Stateless Hash-Based Signatures (Q2948336) (← links)
- (Q2949487) (← links)
- List Decoding for Binary Goppa Codes (Q3005580) (← links)
- Faster 2-Regular Information-Set Decoding (Q3005582) (← links)
- Really Fast Syndrome-Based Hashing (Q3011909) (← links)
- ECC2K-130 on NVIDIA GPUs (Q3058737) (← links)
- Wild McEliece (Q3084251) (← links)
- On the Correct Use of the Negation Map in the Pollard rho Method (Q3084344) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- Wild McEliece Incognito (Q3102796) (← links)
- The 3<i>x</i>+ 1 Conjugacy Map (Q3128433) (← links)
- High-Speed High-Security Signatures (Q3172970) (← links)
- Batch Binary Edwards (Q3183572) (← links)
- Bad Directions in Cryptographic Hash Functions (Q3194624) (← links)
- Detecting perfect powers by factoring into coprimes (Q3420437) (← links)
- Proving primality in essentially quartic random time (Q3420438) (← links)
- Modular exponentiation via the explicit Chinese remainder theorem (Q3420440) (← links)
- Twisted Edwards Curves (Q3506395) (← links)
- Analysis of QUAD (Q3524898) (← links)
- Attacking and Defending the McEliece Cryptosystem (Q3535349) (← links)
- Grover vs. McEliece (Q3569138) (← links)
- Type-II Optimal Polynomial Bases (Q3578464) (← links)