收稿日期: 2001-04-29
网络出版日期: 2001-03-10
基金资助
973资助项目(G1999035802);国家杰出青年科学基金资助项目(60025205)
A New Kind of Digital Signature Algorithm Based on Factoring
Received date: 2001-04-29
Online published: 2001-03-10
范红 . 一种基于大数分解困难性的新型数字签名方案[J]. 中国科学院大学学报, 2001 , 18(2) : 140 -143 . DOI: 10.7523/j.issn.2095-6134.2001.2.009
Puts forward a new digital signature algorithm.This algorithm only need very small on-line computations,short public key and private key,transactions are small.The algorithm is based on the difficulty of factoring a big number.
Key words： signature; verify; public key; private key
1 C P Schnorr.Ef ficient Identi fication and Signat ures f or Smart Cards.In :C rypt o′89, LNCS 435.Berlin :Springer-Verlag, 1990.235 ～ 251
2 M Bellare, P Rogaway.Random O racles are Pract ical :a Parading f or D esigni ng Eff icient Prot ocols.In :Proceedings of t he lst ACM-CCS.ACM press, 1993.62 ～ 73
3 A M enezes, P Van O orschot, S Vanstone.Handbook of A pplied C ryptography.CRC Press, 1997
4 冯登国, 裴定一.密码学导引.北京 :科学出版社, 1999
/
| 〈 |
|
〉 |
