一种基于背包问题的可纠错数字签名方案 |
| |
引用本文: | 邓宇乔;杜明辉. 一种基于背包问题的可纠错数字签名方案[J]. 华南理工大学学报(自然科学版), 2010, 38(6) |
| |
作者姓名: | 邓宇乔 杜明辉 |
| |
作者单位: | 华南理工大学电子与信息学院 |
| |
摘 要: | 基于超递增向量背包问题的可解性,提出一种可纠错数字签名方案。该方案能纠正在网络传输中出错的消息,证明了该方案的安全性。并比较了其与几个纠错数字签名方案的效率,结果证明,该方案具有较好的性能。
|
关 键 词: | 背包问题 超递增向量 可纠错数字签名 RSA |
收稿时间: | 2009-07-01 |
修稿时间: | 2009-09-02 |
An Error-Correcting Digital Signature Scheme Based on Knapsack Problem |
| |
Abstract: | An error-correcting digital signature scheme is presented based on knapsack problem of ultra-increasing Vector. The scheme can correct errors in the network transmission. And prove the scheme’s security. The comparison of its efficiency with another three error-correcting digital signature schemes is also given; the result show that the scheme we presents has better performances. |
| |
Keywords: | knapsack problem ultra-increasing Vector error-correcting digital signature RSA |
|
| 点击此处可从《华南理工大学学报(自然科学版)》浏览原始摘要信息 |