Filters








28 Hits in 3.5 sec

NSS: An NTRU Lattice-Based Signature Scheme [chapter]

Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman
2001 Lecture Notes in Computer Science  
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.  ...  We call this new algorithm NSS for NTRU Signature Scheme.  ... 
doi:10.1007/3-540-44987-6_14 fatcat:fzwer3lxnrdvbpambu7ptpf2he

Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001 [chapter]

Craig Gentry, Jakob Jonsson, Jacques Stern, Michael Szydlo
2001 Lecture Notes in Computer Science  
At Eurocrypt 2001, the NTRU Signature Scheme (NSS), a signature scheme apparently related to the same hard problem, was proposed.  ...  In this paper, we show that the problem on which NSS relies is much easier than anticipated, and we describe an attack that allows efficient forgery of a signature on any message.  ...  Silverman who, after their conception of NSS, were also supportive of cryptanalysis research efforts.  ... 
doi:10.1007/3-540-45682-1_1 fatcat:d4tzkyo5vjcpfj5broxct5mcyu

Weak Property of Malleability in NTRUSign [chapter]

SungJun Min, Go Yamamoto, Kwangjo Kim
2004 Lecture Notes in Computer Science  
A new type of signature scheme, called NTRUSign, based on solving the approximately closest vector problem in a NTRU lattice was proposed at CT-RSA'03.  ...  However no security proof against chosen messages attack has been made for this scheme. In this paper, we show that NTRUSign signature scheme contains the weakness of malleability.  ...  The security of NTRUSign scheme is based on the approximately closest vector problem in a certain lattice, called NTRU lattice.  ... 
doi:10.1007/978-3-540-27800-9_33 fatcat:ggah54scrja5beoj4ed7qsb54q

Cryptanalysis of the Revised NTRU Signature Scheme [chapter]

Craig Gentry, Mike Szydlo
2002 Lecture Notes in Computer Science  
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  ...  After an empirically fast second stage, the third stage of the attack combines lattice-based and congruence-based methods in a novel way to recover the private key in polynomial time.  ...  Introduction The Revised NTRU Signature Scheme (R-NSS) and "NTRUSign" are the two most recent of several signature schemes related to the NTRU encryption scheme (now called NTRUEncrypt).  ... 
doi:10.1007/3-540-46035-7_20 fatcat:kffnjcxvmrbxhlzqrdfxlvz24u

Page 3977 of Mathematical Reviews Vol. , Issue 2003e [page]

2003 Mathematical Reviews  
This article presents an authentification and a digital signature scheme called NTRU signature scheme (NSS).  ...  NSS: an NTRU lattice-based signature scheme. (English summary) Advances in cryptology—EUROCRYPT 2001 (Innsbruck), 211-228, Lecture Notes in Comput. Sci., 2045, Springer, Berlin, 2001.  ... 

A novel mutual authentication and key agreement protocol based on NTRU cryptography for wireless communications

Jiang Jun, He Chen
2005 Journal of Zhejiang University: Science A  
In this paper, the authors present a novel mutual authentication and key agreement protocol based on the Number Theory Research Unit (NTRU) public key cryptography.  ...  wireless authentication schemes such as Beller-Yacobi and M.Aydos protocols.  ...  The CA first generates his public/secret key pair according to the NTRU signature scheme (NSS) algorithm (Hoffstein et al., 2001) .  ... 
doi:10.1631/jzus.2005.a0399 fatcat:ckhwg4o76jahxd7y4iuuywjhzu

Page 6506 of Mathematical Reviews Vol. , Issue 2003h [page]

2003 Mathematical Reviews  
At Eurocrypt 2001, the NTRU signature scheme (NSS), a signature scheme apparently related to the same hard problem, was proposed.  ...  {For the entire collection see MR 2003d:94002. } 2003h:94034 94A60 Gentry, Craig: Jonsson, Jakob; Stern, Jacques (F-ENS-DI; Paris) ; Szydlo, Michael Cryptanalysis of the NTRU signature scheme (NSS) from  ... 

Mobile Energy Requirements of the Upcoming NIST Post-Quantum Cryptography Standards [article]

Markku-Juhani O. Saarinen
2020 arXiv   pre-print
We present an energy requirement analysis based on extensive measurements of PQC candidate algorithms on a Cortex M4 - based reference platform.  ...  Our evidence supports the view that fast structured-lattice PQC schemes are the preferred choice for cloud-connected mobile devices in most use cases, even when per-bit data transmission energy cost is  ...  Google saw this experiment primarily as a comparison between isogeny-based systems and (structured) lattice schemes and tried to pick an "average" algorithm from the latter set.  ... 
arXiv:1912.00916v4 fatcat:ie2z75cgnjgpncgqbt2z5ydrtq

Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign [chapter]

Jeff Hoffstein, Nick Howgrave-Graham, Jill Pipher, William Whyte
2009 The LLL Algorithm  
and NTRU.  ...  We provide a brief history and overview of lattice based cryptography 5 and cryptanalysis: shortest vector problems, closest vector problems, subset sum 6 problem and knapsack systems, GGH, Ajtai-Dwork  ...  to base a digital signature scheme upon the same principles 314 as "NTRU encryption" was NSS [16].  ... 
doi:10.1007/978-3-642-02295-1_11 dblp:series/isc/HoffsteinHPW10 fatcat:h3pjzxbw7rajlja6vikhxo3obm

Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures

Phong Q. Nguyen, Oded Regev
2008 Journal of Cryptology  
Lattice-based signature schemes following the Goldreich-Goldwasser-Halevi (GGH) design have the unusual property that each signature leaks information on the signer's secret key, but this does not necessarily  ...  imply that such schemes are insecure.  ...  Similar assumptions have been used in previous attacks [7, 25] on lattice-based signature schemes.  ... 
doi:10.1007/s00145-008-9031-0 fatcat:bfuvj5h4r5fvtoinqxjq75my3i

Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures [chapter]

Phong Q. Nguyen, Oded Regev
2006 Lecture Notes in Computer Science  
Lattice-based signature schemes following the Goldreich-Goldwasser-Halevi (GGH) design have the unusual property that each signature leaks information on the signer's secret key, but this does not necessarily  ...  imply that such schemes are insecure.  ...  Similar assumptions have been used in previous attacks [7, 25] on lattice-based signature schemes.  ... 
doi:10.1007/11761679_17 fatcat:tow7oj74yzhl3mg7who6ssn5w4

Quantum resistant public key cryptography

Ray A. Perlner, David A. Cooper
2009 Proceedings of the 8th Symposium on Identity and Trust on the Internet - IDtrust '09  
However, advances in quantum computers threaten to undermine the security assumptions upon which currently used public key cryptographic algorithms are based.  ...  this paper, we provide 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  ...  NTRU-based schemes use a specific class of lattices that have an extra symmetry.  ... 
doi:10.1145/1527017.1527028 dblp:conf/idtrust/PerlnerC09 fatcat:ejh6oz6a55cx3n5p4mtxmcaf7i

Lightweight Security and Privacy Preserving Scheme for Smart Grid Customer-Side Networks

Asmaa Abdallah, Xuemin Shen
2017 IEEE Transactions on Smart Grid  
Moreover, the proposed scheme utilizes NTRU cryptosystem to further reduce the computation complexity. Index Terms-Building area networks (BANs), home area networks (HANs), lattice-based scheme NTRU.  ...  In this paper, we propose a lightweight security and privacy preserving scheme that is based on forecasting the electricity demand for a cluster of houses in the same residential area; it limits the cluster's  ...  Section IV reviews lattice-based NTRU scheme and its signing NTRU signature scheme (NSS) scheme. In Section V, we present our proposed scheme.  ... 
doi:10.1109/tsg.2015.2463742 fatcat:ixb4ukgzqjf4dnp2n3ayr5662e

Page 8754 of Mathematical Reviews Vol. , Issue 2002K [page]

2002 Mathematical Reviews  
Silver- man, NSS: an NTRU lattice-based signature scheme (211-228); Dario Catalano, Rosario Gennaro and Nick Howgrave-Graham, The bit security of Paillier’s encryption scheme and its appli- cations (229  ...  improved scheme of the Gennaro-Krawezyk-Rabin undeniable signature sys- tem based on RSA (135-149); Hyun-Jeong Kim, Jong In Lim and Dong Hoon Lee [Dong Hoon Lee?]  ... 

A Subfield Lattice Attack on Overstretched NTRU Assumptions [chapter]

Martin Albrecht, Shi Bai, Léo Ducas
2016 Lecture Notes in Computer Science  
The subfield attack exploits the presence of a subfield to solve overstretched versions of the NTRU assumption: norming the public key h down to a subfield may lead to an easier lattice problem and any  ...  sufficiently good solution may be lifted to a short vector in the full NTRU-lattice.  ...  schemes so far, such an attack will teach us a great deal on the asymptotic security of ideal-lattice based cryptography.  ... 
doi:10.1007/978-3-662-53018-4_6 fatcat:dscjitvbdfhl5ajwfepg5xrbxm
« Previous Showing results 1 — 15 out of 28 results