Easy Simple Factoring-based Digital Signature Scheme

摘要

A newly developed signature scheme, namely the Easy Simple Factoring-based (ESF) signature scheme is proposed in this paper. First, we construct a standard identification scheme based on the ESF assumption. Then, the standard identification scheme is converted to a signature scheme by utilizing the Fiat-Shamir transformation. Our signature scheme is provable secure in the random oracle model, and the security proof is shown. The efficiency analysis of our scheme is conducted and compared with the Full Domain Hash (FDH) signature scheme. Our scheme has a more powerful efficiency performance in signing and verifying algorithms than the FDH signature scheme when the public keys $u$ and γ in our signature scheme are fixed to small bit lengths.