default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNick Howgrave-Graham
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j6]Cong Ling, Wai Ho Mow
, Nick Howgrave-Graham:
Reduced and Fixed-Complexity Variants of the LLL Algorithm for Communications. IEEE Trans. Commun. 61(3): 1040-1050 (2013)- 2010
- [c19]Nick Howgrave-Graham, Antoine Joux:
New Generic Algorithms for Hard Knapsacks. EUROCRYPT 2010: 235-256 - [p1]Jeffrey Hoffstein, Nick Howgrave-Graham, Jill Pipher, William Whyte:
Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign. The LLL Algorithm 2010: 349-390 - [i8]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) - [i7]Nick Howgrave-Graham, Antoine Joux:
New generic algorithms for hard knapsacks. IACR Cryptol. ePrint Arch. 2010: 189 (2010)
2000 – 2009
- 2009
- [c18]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) - 2007
- [c17]Nick Howgrave-Graham:
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU. CRYPTO 2007: 150-169 - [c16]Cong Ling, Nick Howgrave-Graham:
Effective LLL Reduction for Lattice Decoding. ISIT 2007: 196-200 - 2006
- [j4]Don Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyen, Igor E. 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 Cryptol. ePrint Arch. 2005: 45 (2005) - [i5]Nick Howgrave-Graham, Jeffrey Hoffstein, Jill Pipher, William Whyte:
On estimating the lattice security of NTRU. IACR Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2004: 344 (2004) - 2003
- [j3]Nick Howgrave-Graham, Phong Q. Nguyen, Igor E. 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 Cryptol. ePrint Arch. 2003: 172 (2003) - 2002
- [j2]Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham:
Paillier's Trapdoor Function Hides up to O(n) Bits. J. Cryptol. 15(4): 251-269 (2002) - 2001
- [j1]Nick Howgrave-Graham, Nigel P. Smart:
Lattice Attacks on Digital Signature Schemes. Des. Codes Cryptogr. 23(3): 283-290 (2001) - [c8]Dan Boneh, Shai Halevi, Nick Howgrave-Graham:
The Modular Inversion Hidden Number Problem. ASIACRYPT 2001: 36-51 - [c7]Nick Howgrave-Graham:
Approximate Integer Common Divisors. CaLC 2001: 51-66 - [c6]Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham, Phong Q. Nguyen:
Paillier's cryptosystem revisited. CCS 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
1990 – 1999
- 1999
- [c3]Nick Howgrave-Graham, Jean-Pierre Seifert:
Extending Wiener's Attack in the Presence of Many Decrypting Exponents. CQRE 1999: 153-166 - [c2]Dan Boneh, Glenn Durfee, Nick Howgrave-Graham:
Factoring N = prq for Large r. CRYPTO 1999: 326-337 - 1997
- [c1]Nick Howgrave-Graham:
Finding Small Roots of Univariate Modular Equations Revisited. IMACC 1997: 131-142
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
