Short Signatures from Difficulty of Factorization Problem

@article{Moldovyan2009ShortSF,
  title={Short Signatures from Difficulty of Factorization Problem},
  author={Nikolay A. Moldovyan},
  journal={I. J. Network Security},
  year={2009},
  volume={8},
  pages={90-95}
}
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. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

A method for obtaining digital signatures and public key cryptosystems

  • R. L. Rivest, A.Shamir, L. M. Adleman
  • Communications of the ACM, vol. 21, no 2, pp. 120…
  • 1978
Highly Influential
7 Excerpts

Another look at rovable security

  • N. Koblitz, A. J. Menezes
  • Journal of Cryptology, vol. 20, pp. 3- 38, 2007.
  • 2007
1 Excerpt

Vanstone “ Postal revenue collection in the digital age

  • S.
  • Proceedings of Financial Cryptography
  • 2006

Similar Papers

Loading similar papers…