2007 |
20 | EE | Nick Howgrave-Graham:
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU.
CRYPTO 2007: 150-169 |
2006 |
19 | EE | Nicolas Gama,
Nick Howgrave-Graham,
Henrik Koy,
Phong Q. Nguyen:
Rankin's Constant and Blockwise Lattice Reduction.
CRYPTO 2006: 112-130 |
18 | EE | Nicolas Gama,
Nick Howgrave-Graham,
Phong Q. Nguyen:
Symplectic Lattice Reduction and NTRU.
EUROCRYPT 2006: 233-253 |
17 | EE | 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) |
2005 |
16 | EE | Nick Howgrave-Graham,
Joseph H. Silverman,
William Whyte:
Choosing Parameter Sets forwithand.
CT-RSA 2005: 118-135 |
2004 |
15 | EE | Nick Howgrave-Graham,
Michael Szydlo:
A Method to Solve Cyclotomic Norm Equations.
ANTS 2004: 272-279 |
2003 |
14 | EE | Pierre-Alain Fouque,
Nick Howgrave-Graham,
Gwenaëlle Martinet,
Guillaume Poupard:
The Insecurity of Esign in Practical Implementations.
ASIACRYPT 2003: 492-506 |
13 | EE | 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 |
12 | EE | Jeffrey Hoffstein,
Nick Howgrave-Graham,
Jill Pipher,
Joseph H. Silverman,
William Whyte:
NTRUSIGN: Digital Signatures Using the NTRU Lattice.
CT-RSA 2003: 122-140 |
11 | | 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) |
2002 |
10 | EE | 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 |
9 | EE | Dario Catalano,
Rosario Gennaro,
Nick Howgrave-Graham,
Phong Q. Nguyen:
Paillier's cryptosystem revisited.
ACM Conference on Computer and Communications Security 2001: 206-214 |
8 | EE | Dan Boneh,
Shai Halevi,
Nick Howgrave-Graham:
The Modular Inversion Hidden Number Problem.
ASIACRYPT 2001: 36-51 |
7 | EE | Nick Howgrave-Graham,
Joan G. Dyer,
Rosario Gennaro:
Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor.
CHES 2001: 93-102 |
6 | EE | Nick Howgrave-Graham:
Approximate Integer Common Divisors.
CaLC 2001: 51-66 |
5 | EE | Dario Catalano,
Rosario Gennaro,
Nick Howgrave-Graham:
The Bit Security of Paillier's Encryption Scheme and Its Applications.
EUROCRYPT 2001: 229-243 |
4 | | Nick Howgrave-Graham,
Nigel P. Smart:
Lattice Attacks on Digital Signature Schemes.
Des. Codes Cryptography 23(3): 283-290 (2001) |
1999 |
3 | EE | Nick Howgrave-Graham,
Jean-Pierre Seifert:
Extending Wiener's Attack in the Presence of Many Decrypting Exponents.
CQRE 1999: 153-166 |
2 | EE | Dan Boneh,
Glenn Durfee,
Nick Howgrave-Graham:
Factoring N = prq for Large r.
CRYPTO 1999: 326-337 |
1997 |
1 | | Nick Howgrave-Graham:
Finding Small Roots of Univariate Modular Equations Revisited.
IMA Int. Conf. 1997: 131-142 |