NSS: A Lattice-Based Signature Scheme
نویسندگان
چکیده
The purpose of this paper is to submit the NSS lattice based signature scheme for consideration for inclusion in the IEEE P1363.1 standard. At the rump session of CRYPTO ’96 the authors introduced a highly efficient new public key cryptosystem called NTRU. (See [4] for details.) Underlying NTRU is a hard mathematical problem of finding short vectors in certain lattices. In this paper we introduce a complementary fast authentication and digital signature scheme that uses public and private keys of the same form as those used by the NTRU public key cryptosystem. The underlying hard problem of finding short vectors in certain lattices is also identical to the underlying hard problem for NTRU. We call this new algorithm NSS for NTRU Signature Scheme.
منابع مشابه
NSS: An NTRU Lattice-Based Signature Scheme
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 creation.
متن کاملNSS: The NTRU Signature Scheme
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 creation.
متن کاملTitle: Enhanced Encoding and Verification Methods for the Ntru Signature Scheme Section 1. the Hard Problem Underlying Ntru and Nss
The NTRU Signature Scheme (NSS) is a digital signature scheme based on a hard lattice problem. This lattice problem also underlies the NTRU Public Key Cryptosystem described in [1]. In this section we remind the reader of the standard description of the NTRU lattice problem in terms of products of polynomials in convolution rings. For further details, see [1]. Fix three positive integer paramet...
متن کاملCryptanalysis of the Revised NTRU Signature Scheme
In this paper, we describe a three-stage attack against Revised NSS, an NTRU-based signature scheme proposed at the Eurocrypt 2001 conference as an enhancement of the (broken) proceedings version of the scheme. The first stage, which typically uses a transcript of only 4 signatures, effectively cuts the key length in half while completely avoiding the intended hard lattice problem. After an emp...
متن کاملThe NTRU Signature Scheme: Theory and Practice
The NTRU Signature Scheme (NSS) with enhanced document encoding and signature verification is described. Three areas of security are investigated: (1) It is proven (under a heuristic assumption) that direct forgery is equivalent to the solution of a closest vector problem, up to constant factor, in an NTRU convolution modular lattice. (2) The probability of forgery using partially preselected v...
متن کامل