The following pages link to N. A. Howgrave-Graham (Q203442):
Displaying 22 items.
- (Q1865125) (redirect page) (← links)
- Paillier's trapdoor function hides up to \(O(n)\) bits (Q1865126) (← links)
- Testing set proportionality and the Ádám isomorphism of circulant graphs (Q2458932) (← links)
- (Q2778852) (← links)
- (Q3369392) (← links)
- New Generic Algorithms for Hard Knapsacks (Q3563838) (← links)
- Symplectic Lattice Reduction and NTRU (Q3593099) (← links)
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU (Q3612548) (← links)
- (Q4418531) (← links)
- (Q4474164) (← links)
- (Q4787198) (← links)
- (Q4797788) (← links)
- Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation (Q4806399) (← links)
- (Q4941863) (← links)
- Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign (Q5188547) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428123) (← links)
- Divisors in residue classes, constructively (Q5429512) (← links)
- Algorithmic Number Theory (Q5465628) (← links)
- Topics in Cryptology – CT-RSA 2005 (Q5710828) (← links)
- Rankin’s Constant and Blockwise Lattice Reduction (Q5756630) (← links)
- Advances in Cryptology - ASIACRYPT 2003 (Q5902401) (← links)
- Lattice attacks on digital signature schemes (Q5943686) (← links)
