A Digital Signature Scheme for Long-Term Security

2012/03/19 by Poulakis, Dimitrios, Rolland, Robert
#Cryptography and Security (cs.CR) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1203.4077

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.

Related

• A Cryptographic Study of Some Digital Signature Schemes
• A GOST-like Blind Signature Scheme Based on Elliptic Curve Discrete Logarithm Problem
• An Efficient Signature Scheme based on Factoring and Discrete Logarithm
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A Secure Multiple Elliptic Curves Digital Signature Algorithm for Blockchain