A Digital Signature Scheme Based on Discrete Logarithms and Factoring
Liping Yang
Abstract
Liping Yang
Abstract
At present,the security of public key cryptography system is mainly built on a mathematical problem,such as the discrete logarithm problem and the factorization problem.With development of technology and cryptography,it is difficult to ensure that these mathematical problems are not solved.But it is unlikely to solve these problems at the same time.This paper proposes a new digital signature scheme and analyzes security of the new scheme,shows the scheme is based on discrete logarithms and factoring simultaneously.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
At present,the security of public key cryptography system is mainly built on a mathematical problem,such as the discrete logarithm problem and the factorization problem.With development of technology and cryptography,it is difficult to ensure that these mathematical problems are not solved.But it is unlikely to solve these problems at the same time.This paper proposes a new digital signature scheme and analyzes security of the new scheme,shows the scheme is based on discrete logarithms and factoring simultaneously.
Key concepts: Discrete logarithm, Factoring, Digital signature, Post-quantum cryptography, Scheme (mathematics), Cryptography, Logarithm, Public-key cryptography