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â€¦ (More)

The set of morphisms Ï† : P â†’ P of degree d is parametrized by an affine open subset Ratd of P . We consider the action of SL2 on Ratd induced by the conjugation action of SL2 on rational maps; thatâ€¦ (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â€¦ (More)

Whenever a PKC is designed, it is also analyzed whether it could be used as a signature scheme. In this paper, how the NTRU concept can be used to form a digital signature scheme [1] is described.

A method is described for performing computations in a finite field GF(2 ) by embedding it in a larger ring Rp where the multiplication operation is a convolution product and the squaring operationâ€¦ (More)

The increasing connectivity o ered by constrained computing devices signals a vital need for public-key cryptography in such environments. By their nature, however, public-key systems have beenâ€¦ (More)

We present, for the first time, an algorithm to choose parameter sets for NTRUEncrypt that give a desired level of security. Note: This is an expanded version of a paper presented at CT-RSA 2005.