NTRUSIGN: Digital Signatures Using the NTRU Lattice

  title={NTRUSIGN: Digital Signatures Using the NTRU Lattice},
  author={Jeffrey Hoffstein and Nick Howgrave-Graham and Jill Pipher and Joseph H. Silverman and William Whyte},
We present a mechanism to encrypt to an arbitrary collection of identities using a variant of the Boneh-Franklin identity based encryption scheme. The decryptor is defined by a logical formulae of conjunctions and disjunctions. This enables a simple mechanism to drive access control to broadcast encrypted data using user identities as the public keys. 

Practical Lattice-Based Digital Signature Schemes

This article focuses on recent developments and the current state of the art in lattice-based digital signatures and provides a comprehensive survey discussing signature schemes with respect to practicality and discusses future research areas that are essential for the continued development of lattICE-based cryptography.

Cryptanalysis and Secure Implementation of Modern Cryptographic Algorithms

An off-the-shelf SAT solver is investigated to improve the key recovery of the Advance Encryption Standard (AES-128) key schedules from its corresponding decayed memory images which can be obtained using cold-boot attacks.

Quantum resistant public key cryptography: a survey

A survey of some of the public key cryptographic algorithms that have been developed that, while not currently in widespread use, are believed to be resistant to quantum computing based attacks and discuss some the issues that protocol designers may need to consider if there is a need to deploy these algorithms at some point in the future.

Géométrie des nombres et cryptanalyse de NTRU

La cryptographie a clef publique, inventee par Diffie et Hellman en 1976, fait aujourd'hui partie de la vie courante : les cartes bleues, les consoles de jeux et le commerce electronique par exemple

A signature scheme from the finite field isomorphism problem

This paper investigates how one might build a digital signature scheme from this new problem, called the finite field isomorphism problem, which was proposed in a recent paper and used to construct a fully homomorphic encryption scheme.

BAT: Small and Fast KEM over NTRU Lattices

BAT is presented – an IND-CCA secure key encapsulation mechanism (KEM) that is based on NTRU but follows an encryption/decryption paradigm distinct from classical N TRU KEMs that has more compact parameters than all current lattice-based schemes and a practical efficiency.

Lattice Attacks on NTRU Revisited

A new dimension reduction attack on NTRU without considering the pattern of private polynomials is presented and it is proved that one can recover a group of equivalent private keys by solving shortest vector problem in a new dimension-reduced lattice with dimension <inline-formula> <tex- math notation="LaTeX">$N+k, k < N$ </tex-math></inline- formula>.


  • Mehmet
  • Mathematics, Computer Science
  • 2020
It is stated that these generalizations made by adding a security parameter “n” to NTRU cryptosystem creates a new NTRUSIGN.

Klepto for post-quantum signatures

Kleptography is investigated in post-quantum signature schemes, and new backdoors in NTRU Signature Schemes are given, along with an analysis.



Public-key cryptography from lattice reduction problems

Dimension Reduction Methods for Convolution Modular Lattices

We describe a dimension reduction method for convolution modular lattices. Its effectiveness and implications for parallel and distributed computing are analyzed.

A course in computational algebraic number theory

  • H. Cohen
  • Computer Science, Mathematics
    Graduate texts in mathematics
  • 1993
The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods.

On Lovász’ lattice reduction and the nearest lattice point problem

  • L. Babai
  • Mathematics, Computer Science
  • 1986
Answering a question of Vera Sós, we show how Lovász’ lattice reduction can be used to find a point of a given lattice, nearest within a factor ofcd (c = const.) to a given point in Rd. We prove that

Software Implementation of Elliptic Curve Cryptography over Binary Fields

This paper presents an extensive and careful study of the software implementation on workstations of the NIST-recommended elliptic curves over binary fields. We also present the results of our

Cryptographic Hardware and Embedded Systems — CHES 2000

Polynomial Rings and Efficient Public Key Authentication II

This paper shows 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.