Provided by: International Association for Cryptologic Research
Date Added: Sep 2012
Nearly all of the currently used and well-tested signature schemes (e.g. RSA or DSA) are based either on the factoring assumption or the presumed intractability of the discrete logarithm problem. Further algorithmic advances on these problems may lead to the unpleasant situation that a large number of schemes have to be replaced with alternatives. In this paper the authors present such an alternative - a signature scheme whose security is derived from the hardness of lattice problems.