2007 |
21 | EE | Joseph H. Silverman,
William Whyte:
Timing Attacks on NTRUEncrypt Via Variation in the Number of Hash Calls.
CT-RSA 2007: 208-224 |
2005 |
20 | EE | Nick Howgrave-Graham,
Joseph H. Silverman,
William Whyte:
Choosing Parameter Sets forwithand.
CT-RSA 2005: 118-135 |
2004 |
19 | EE | Joseph H. Silverman,
Nigel P. Smart,
Frederik Vercauteren:
An Algebraic Approach to NTRU (q = 2n) via Witt Vectors and Overdetermined Systems of Nonlinear Equations.
SCN 2004: 278-293 |
2003 |
18 | 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 |
17 | 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 |
16 | EE | Jeffrey Hoffstein,
Joseph H. Silverman:
Random small Hamming weight products with applications to cryptography.
Discrete Applied Mathematics 130(1): 37-49 (2003) |
2001 |
15 | | Joseph H. Silverman:
Cryptography and Lattices, International Conference, CaLC 2001, Providence, RI, USA, March 29-30, 2001, Revised Papers
Springer 2001 |
14 | EE | Daniel V. Bailey,
Daniel Coffin,
Adam J. Elbirt,
Joseph H. Silverman,
Adam D. Woodbury:
NTRU in Constrained Devices.
CHES 2001: 262-272 |
13 | EE | Alexander May,
Joseph H. Silverman:
Dimension Reduction Methods for Convolution Modular Lattices.
CaLC 2001: 110-125 |
12 | EE | Jeffrey Hoffstein,
Jill Pipher,
Joseph H. Silverman:
NSS: An NTRU Lattice-Based Signature Scheme.
EUROCRYPT 2001: 211-228 |
11 | | Igor Shparlinski,
Joseph H. Silverman:
On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves.
Des. Codes Cryptography 24(3): 279-289 (2001) |
2000 |
10 | EE | Jeffrey Hoffstein,
Joseph H. Silverman:
MiniPASS: Authentication and Digital Signatures in a Constrained Environment.
CHES 2000: 328-339 |
9 | | Michael J. Jacobson Jr.,
Neal Koblitz,
Joseph H. Silverman,
Andreas Stein,
Edlyn Teske:
Analysis of the Xedni Calculus Attack.
Des. Codes Cryptography 20(1): 1-64 (2000) |
8 | | Joseph H. Silverman:
The Xedni Calculus and the Elliptic Curve Discrete Logarithm Problem.
Des. Codes Cryptography 20(1): 5-40 (2000) |
7 | EE | Joseph H. Silverman:
On the distribution of integer points on curves of genus zero.
Theor. Comput. Sci. 235(1): 163-170 (2000) |
1999 |
6 | EE | Joseph H. Silverman:
Fast Multiplication in Finite Fields GF(2N).
CHES 1999: 122-134 |
5 | | Joseph H. Silverman:
Computing rational points on rank 1 elliptic curves via $L$-series and canonical heights.
Math. Comput. 68(226): 835-858 (1999) |
1998 |
4 | EE | Jeffrey Hoffstein,
Jill Pipher,
Joseph H. Silverman:
NTRU: A Ring-Based Public Key Cryptosystem.
ANTS 1998: 267-288 |
3 | EE | Joseph H. Silverman,
Joe Suzuki:
Elliptic Curve Discrete Logarithms and the Index Calculus.
ASIACRYPT 1998: 110-125 |
1997 |
2 | | Joseph H. Silverman:
Computing canonical heights with little (or no) factorization.
Math. Comput. 66(218): 787-805 (1997) |
1996 |
1 | | Gregory S. Call,
Joseph H. Silverman:
Computing the canonical height on K3 surfaces.
Math. Comput. 65(213): 259-290 (1996) |