The following pages link to Nadia Heninger (Q855872):
Displaying 17 items.
- On the integrality of \(n\)th roots of generating functions (Q855873) (← links)
- Post-quantum RSA (Q1673617) (← links)
- On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← links)
- Properties of constacyclic codes under the Schur product (Q2182071) (← links)
- Characterizing overstretched NTRU attacks (Q2191207) (← links)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
- Biased nonce sense: lattice attacks against weak ECDSA signatures in cryptocurrencies (Q2656908) (← links)
- Short paper: The proof is in the pudding. Proofs of work for solving discrete logarithms (Q2656918) (← links)
- Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild (Q2867164) (← links)
- Approximate common divisors via lattices (Q2949498) (← links)
- Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials (Q2958146) (← links)
- Reconstructing RSA Private Keys from Random Key Bits (Q3183554) (← links)
- RSA, DH and DSA in the Wild (Q5034408) (← links)
- Sliding Right into Disaster: Left-to-Right Sliding Windows Leak (Q5114649) (← links)
- A Kilobit Hidden SNFS Discrete Logarithm Computation (Q5738878) (← links)
- Factoring as a Service (Q5857781) (← links)
