A Digital Signature Scheme for Long-Term Security
Dimitrios Poulakis, Robert Rolland

TL;DR
This paper introduces a digital signature scheme leveraging two hard problems, aiming for long-term security and improved efficiency over existing solutions.
Contribution
It presents a novel signature scheme based on integer factorization and elliptic curve discrete logarithm problems for enhanced long-term security.
Findings
Provides a more efficient signature scheme for long-term security
Based on two intractable problems for increased robustness
Suitable for applications requiring durable security
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic · Cryptography and Data Security · Digital Image Processing Techniques
