| 2013 | ||
|---|---|---|
| j6 | Cong Ling, Wai Ho Mow, Nick Howgrave-Graham: Reduced and Fixed-Complexity Variants of the LLL Algorithm for Communications. IEEE Transactions on Communications 61(3): 1040-1050 (2013) | |
| 2010 | ||
| c18 | Nick Howgrave-Graham, Antoine Joux: New Generic Algorithms for Hard Knapsacks. EUROCRYPT 2010: 235-256 | |
| i9 | Cong Ling, Wai Ho Mow, Nick Howgrave-Graham: Variants of the LLL Algorithm in Digital Communications: Complexity Analysis and Fixed-Complexity Implementation. CoRR abs/1006.1661 (2010) | |
| i8 | Nick Howgrave-Graham, Antoine Joux: New generic algorithms for hard knapsacks. IACR Cryptology ePrint Archive 2010: 189 (2010) | |
| 2009 | ||
| c17 | Philip S. Hirschhorn, Jeffrey Hoffstein, Nick Howgrave-Graham, William Whyte: Choosing NTRUEncrypt Parameters in Light of Combined Lattice Reduction and MITM Approaches. ACNS 2009: 437-455 | |
| 2008 | ||
| j5 | Don Coppersmith, Nick Howgrave-Graham, S. V. Nagaraj: Divisors in residue classes, constructively. Math. Comput. 77(261): 531-545 (2008) | |
| i7 | William Whyte, Nick Howgrave-Graham, Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman, Philip S. Hirschhorn: IEEE P1363.1 Draft 10: Draft Standard for Public Key Cryptographic Techniques Based on Hard Problems over Lattices. IACR Cryptology ePrint Archive 2008: 361 (2008) | |
| 2007 | ||
| c16 | Nick Howgrave-Graham: A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU. CRYPTO 2007: 150-169 | |
| 2006 | ||
| j4 | Don Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyen, Igor Shparlinski: Testing set proportionality and the Ádám isomorphism of circulant graphs. J. Discrete Algorithms 4(2): 324-335 (2006) | |
| c15 | Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Phong Q. Nguyen: Rankin's Constant and Blockwise Lattice Reduction. CRYPTO 2006: 112-130 | |
| c14 | Nicolas Gama, Nick Howgrave-Graham, Phong Q. Nguyen: Symplectic Lattice Reduction and NTRU. EUROCRYPT 2006: 233-253 | |
| 2005 | ||
| c13 | Nick Howgrave-Graham, Joseph H. Silverman, William Whyte: Choosing Parameter Sets forwithand. CT-RSA 2005: 118-135 | |
| i6 | Nick Howgrave-Graham, Joseph H. Silverman, William Whyte: Choosing Parameter Sets for NTRUEncrypt with NAEP and SVES-3. IACR Cryptology ePrint Archive 2005: 45 (2005) | |
| i5 | Nick Howgrave-Graham, Jeffrey Hoffstein, Jill Pipher, William Whyte: On estimating the lattice security of NTRU. IACR Cryptology ePrint Archive 2005: 104 (2005) | |
| i4 | Jeffrey Hoffstein, Nick Howgrave-Graham, Jill Pipher, Joseph H. Silverman, William Whyte: Performance Improvements and a Baseline Parameter Generation Algorithm for NTRUSign. IACR Cryptology ePrint Archive 2005: 274 (2005) | |
| 2004 | ||
| c12 | Nick Howgrave-Graham, Michael Szydlo: A Method to Solve Cyclotomic Norm Equations. ANTS 2004: 272-279 | |
| i3 | Don Coppersmith, Nick Howgrave-Graham, S. V. Nagaraj: Divisors in Residue Classes, Constructively. IACR Cryptology ePrint Archive 2004: 339 (2004) | |
| i2 | Nick Howgrave-Graham, Joseph H. Silverman, Ari Singer, William Whyte: Modified Parameter Attacks: Practical Attacks against CCA2 Secure Cryptosystems and Countermeasures. IACR Cryptology ePrint Archive 2004: 344 (2004) | |
| 2003 | ||
| j3 | Nick Howgrave-Graham, Phong Q. Nguyen, Igor Shparlinski: Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation. Math. Comput. 72(243): 1473-1485 (2003) | |
| c11 | Pierre-Alain Fouque, Nick Howgrave-Graham, Gwenaëlle Martinet, Guillaume Poupard: The Insecurity of Esign in Practical Implementations. ASIACRYPT 2003: 492-506 | |
| c10 | Nick Howgrave-Graham, Phong Q. Nguyen, David Pointcheval, John Proos, Joseph H. Silverman, Ari Singer, William Whyte: The Impact of Decryption Failures on the Security of NTRU Encryption. CRYPTO 2003: 226-246 | |
| c9 | Jeffrey Hoffstein, Nick Howgrave-Graham, Jill Pipher, Joseph H. Silverman, William Whyte: NTRUSIGN: Digital Signatures Using the NTRU Lattice. CT-RSA 2003: 122-140 | |
| i1 | Nick Howgrave-Graham, Joseph H. Silverman, Ari Singer, William Whyte: NAEP: Provable Security in the Presence of Decryption Failures. IACR Cryptology ePrint Archive 2003: 172 (2003) | |
| 2002 | ||
| j2 | Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham: Paillier's Trapdoor Function Hides up to O(n) Bits. J. Cryptology 15(4): 251-269 (2002) | |
| 2001 | ||
| j1 | Nick Howgrave-Graham, Nigel P. Smart: Lattice Attacks on Digital Signature Schemes. Des. Codes Cryptography 23(3): 283-290 (2001) | |
| c8 | Dan Boneh, Shai Halevi, Nick Howgrave-Graham: The Modular Inversion Hidden Number Problem. ASIACRYPT 2001: 36-51 | |
| c7 | ||
| c6 | Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham, Phong Q. Nguyen: Paillier's cryptosystem revisited. ACM Conference on Computer and Communications Security 2001: 206-214 | |
| c5 | Nick Howgrave-Graham, Joan G. Dyer, Rosario Gennaro: Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor. CHES 2001: 93-102 | |
| c4 | Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham: The Bit Security of Paillier's Encryption Scheme and Its Applications. EUROCRYPT 2001: 229-243 | |
| 1999 | ||
| c3 | Nick Howgrave-Graham, Jean-Pierre Seifert: Extending Wiener's Attack in the Presence of Many Decrypting Exponents. CQRE 1999: 153-166 | |
| c2 | ||
| 1997 | ||
| c1 | Nick Howgrave-Graham: Finding Small Roots of Univariate Modular Equations Revisited. IMA Int. Conf. 1997: 131-142 | |
Colors in the list of coauthors
Last update Tue May 21 12:06:19 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page