For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Digital Signature Scheme Based on NP-Complete Lattice Problems
Shunichi HAYASHI Mitsuru TADA
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2008/05/01
Online ISSN: 1745-1337
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Cryptography and Information Security
NP-complete problem, lattice, identification scheme, signature scheme,
Full Text: PDF(220KB)>>
In , we proposed new decision problems related to lattices, and proved their NP-completeness. In this paper, we present a new public-key identification scheme and a digital signature scheme based on one of the problems in . We also prove the security of our schemes under certain assumptions, and analyze the efficiency of ours.