#### Filter Results:

- Full text PDF available (40)

#### Publication Year

1996

2017

- This year (2)
- Last 5 years (10)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman
- ANTS
- 1998

We describe NTRU, a new public key cryptosystem. NTRU features reasonably short, easily created keys, high speed, and low memory requirements. NTRU encryption and decryption use a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability theory. The security of the NTRU cryptosystem comes from the… (More)

Given a root system Φ of rank r and a global field F containing the n-th roots of unity, it is possible to define a Weyl group multiple Dirichlet series whose coefficients are n-th order Gauss sums. It is a function of r complex variables, and it has meromorphic continuation to all of C, with functional equations forming a group isomorphic to the Weyl group… (More)

- Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman
- EUROCRYPT
- 2001

A new authentication and digital signature scheme called the NTRU Signature Scheme (NSS) is introduced. NSS provides an authentication/signature method complementary to the NTRU public key cryptosystem. The hard lattice problem underlying NSS is similar to the hard problem underlying NTRU, and NSS similarly features high speed, low footprint, and easy key… (More)

In this note we describe a variety of methods that may be used to increase the speed and efficiency of the NTRU public key cryptosystem. 1991 Mathematics Subject Classification: 94A60, 11T71. 1. An Overview of NTRU The NTRU Public Key Cryptosystem is based on ring theory and relies for its security on the difficulty of solving certain lattice problems. In… (More)

- Jeffrey Hoffstein, Nick Howgrave-Graham, Jill Pipher, Joseph H. Silverman, William Whyte
- IACR Cryptology ePrint Archive
- 2005

The NTRUSign signature scheme was introduced in [8]. The original presentation gave a theoretical description of the scheme and an analysis of its security, along with several parameter choices which claimed to yield an 80 bit security level. The paper [8] did not give a general recipe for generating parameter sets to a specific level of security. In line… (More)

This paper develops an analytic theory of Dirichlet series in several complex variables which possess sufficiently many functional equations. In the first two sections it is shown how straightforward conjectures about the meromorphic continuation and polar divisors of certain such series imply, as a consequence, precise asymptotics (previously conjectured… (More)

We present the new NTRUEncrypt parameter generation algorithm, which is designed to be secure in light of recent attacks that combine lattice reduction and meet-in-the-middle (MITM) techniques. The parameters generated from our algorithm have been submitted to several standard bodies and are presented at the end of the paper.

- Jeffrey Hoffstein, Joseph H. Silverman
- Discrete Applied Mathematics
- 2003

There are many cryptographic constructions in which one uses a random power or multiple of an element in a group or a ring. We describe a fast method to compute random powers and multiples in certain important situations including powers in the Galois field F2n , multiples on Koblitz elliptic curves, and multiples in NTRU convolution polynomial rings. The… (More)