#### Filter Results:

#### Publication Year

1996

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

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)

- Benjamin Brubaker, Daniel Bump, Gautam Chinta, Solomon Friedberg, Jeffrey Hoffstein
- 2006

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 r , with functional equations forming a group isomorphic to the Weyl… (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)

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. The NTRU Public Key Cryptosystem is based on ring theory and relies for its security on the difficulty of solving certain lattice problems. In this section we will briefly review the properties of NTRU that are relevant to… (More)

Specifications of common public-key cryptographic techniques based on hard problems over 1 lattices supplemental to those considered in IEEE 1363 and IEEE P1363a, including mathematical 2 primitives for secret value (key) derivation, public-key encryption, identification and digital signatures, and 3 cryptographic schemes based on those primitives.… (More)

A new authentication and digital signature scheme called the NTRU Signature Scheme (NSS) is introduced. NSS provides an authenti-cation/signature method complementary to the NTRU public key cryp-tosystem. 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 a recent paper [3] a highly efficient public key authentica-tion scheme called PASS was introduced. In this paper we show how a small modification in the scheme cuts the size of the public key and the commitment in half while reducing an already minimal computational load. Non-Technical Description of Work. A new public key authentication method was… (More)

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)