Journal of South China University of Technology (Natural Science Edition) ›› 2010, Vol. 38 ›› Issue (6): 46-49.doi: 10.3969/j.issn.1000-565X.2010.06.009

• Electronics, Communication & Automation Technology • Previous Articles     Next Articles

Error-Correcting Digital Signature Scheme Based on Knapsack Problem

Deng Yu-qiao  Du Ming-hui  Liang Ya-ling  Liao Bing   

  1. School of Electronic and Information Engineering,South China University of Technology,Guangzhou 510640,Guangdong,China
  • Received:2009-07-01 Revised:2009-09-02 Online:2010-06-25 Published:2010-06-25
  • Contact: 邓宇乔（1980-），男，博士生，主要从事密码学、安全电子支付、数字版权管理系统研究． E-mail:yuqiao．deng@scut．edu．cn
  • About author:邓宇乔（1980-），男，博士生，主要从事密码学、安全电子支付、数字版权管理系统研究．
  • Supported by:

    广东省自然科学基金资助项目（05006593）

PDF

1064

Abstract:

The rapid development of the Internet tends to cause transmission errors of digital signature in networks.However,the traditional digital signature schemes cannot correct the errors because these schemes never take error-correction into consideration.In order to solve this problem and to implement high-efficiency signature,an error-correcting digital signature scheme is presented according to the existing schemes.The proposed scheme is based on the thought of matrix and the knapsack problem of ultra-increasing vector.As compared with several existing error-correcting digital signature schemes,the proposed scheme,which effectively corrects the transmission errors of di-gital signature in networks,is of the least additional data and calculation load.The security of the scheme is also proven based on the random oracle model.

Key words: digital signatures, knapsack problem, ultra-increasing vector, error correction, RSA public-key encryption algorithm