A Digital Signature Scheme for Long-Term Security
classification
💻 cs.CR
keywords
long-termproblemschemesecuritysignatureapplicationscurvesdigital
read the original abstract
In this paper we propose a signature scheme based on two intractable problems, namely the integer factorization problem and the discrete logarithm problem for elliptic curves. It is suitable for applications requiring long-term security and provides a more efficient solution than the existing ones.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.