Short Signatures from Difficulty of Factorization Problem
Nikolay Andreevich Moldovyan · 2009
New ways are proposed to design short signature schemes based on difficulty of factorizing a composite number n that is a product of two large secret primes. The paper presents digital signature schemes in which the signature represents a pair of numbers (k, g) and its length is reduced to 320 bits providing security of the RSA cryptosystem with 1024-bit modulus.