透過您的圖書館登入
IP:18.119.19.16

摘要


Digital signatures are used to confirm the identity of the sender of a digital message or a document. There are many digital signature algorithms in the world. But the need for a better signature scheme is not fulfilled yet. In this paper, a novel digital signature algorithm is presented with proving the efficiency against some kind of cyber attacks. The proposed signature scheme is based on the prime factorization and on a simple, interesting property in Mathematics. The mathematical property is the sum of 2 ancillary odd numbers is a multiple of 4. The significance of the scheme is the signature is not generated from the message, directly. The new signature scheme is very simple and fast. But, the scheme is strong as the RSA signatures in security and the scheme is faster than the RSA in some cases. We can also use hash functions with the proposed signature scheme to strong the security.

延伸閱讀