CRMar 19, 2012
A Digital Signature Scheme for Long-Term Security
arXiv:1203.4077v21 citations
Originality Synthesis-oriented
AI Analysis
This addresses the need for secure digital signatures in applications requiring long-term protection, though it appears incremental as it combines known cryptographic problems.
The paper tackles the problem of creating digital signatures with long-term security by proposing a new scheme based on both integer factorization and elliptic curve discrete logarithm problems, resulting in a more efficient solution than existing methods.
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.