A digital signature scheme based on NP-complete lattice problems

Abstract

In [13],we proposed new dcision problems related to lattices, and proved their NP-completeness. In this paper, we present a new public-key identifications scheme and a digital signatures scheme based on one of the problems in [13]. We also prove the security of our schemes underc certain assumptions, and analyze the efficiency of ours. Copyright © 2008 The Institute of Electronics, Information and Communication Engineers.