Open AccessLattice signatures using NTRU on the hardness of worst‐case ideal lattice problems
Author(s) -
Das Dipayan,
Saraswat Vishal,
Basu Kajla
Publication year - 2020
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2019.0580
Subject(s) - ntru , random oracle , ring signature , lattice problem , schnorr signature , merkle signature scheme , learning with errors , lattice (music) , mathematics , lattice based cryptography , theoretical computer science , oracle , computer science , discrete mathematics , public key cryptography , blind signature , algorithm , cryptography , encryption , computer security , physics , quantum cryptography , software engineering , quantum mechanics , acoustics , quantum information , quantum
Recently, lattice signatures based on the Fiat‐Shamir framework have seen a lot of improvements which are efficient in practice. The security of these signature schemes depends mainly on the hardness of solving short integer solutions (SIS) and/or learning with errors problem in the random oracle model. The authors propose an alternative lattice‐based signature scheme on the Fiat‐Shamir framework over the ringZ [ x ] / ( x n + 1 ) . The key generation in the signature scheme is based on the combination of NTRU and Ring SIS like key generation. Both the signature and the verification are done efficiently by doing polynomial convolutions in the ringZ [ x ] / ( x n + 1 ) . The proposed signature scheme is provably secure based on the hardness of the Ring SIS problem in the random oracle model. The scheme is also efficient up to constant factors as the highly practical schemes which have provable secure instantiation.