透過您的圖書館登入
IP:3.144.250.223
  • 期刊

Signature Schemes with Efficient Online Computation

並列摘要


This paper presents two signature schemes which are specially designed so as to reduce the online computational work for a signer. In many schemes of signature, the signer's major online computational cost is the operation of modular multiplication which consists of an integer multiplication and a reduction. The proposed schemes are arranged to remove the operation of integer multiplication from online signing procedure. The benefit is to reduce the amount of online computations. Theoretically, while sizes of public key and secret key, signature size, and security level remain unchanged, the cost of online computations can be reduced about 14%, comparing with that of Schnorr signature scheme.

被引用紀錄


陳皇佑(2009)。一個以後門赫序函數運算之高效率電子現金系統〔碩士論文,朝陽科技大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0078-1111200915521691

延伸閱讀