کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9506616 | 1340754 | 2005 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Improved DSA variant for batch verification
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Batch verification is a method to verify multiple signatures at once. There are two issues associated with batch verification. One is the security problem and the other is the computational speed. In 1998, Bellare et al. have proposed an approach called small exponents test, to preserve the security of batch verification of a digital signature algorithm (DSA) variant. In this letter, we propose an efficient scheme to speed up DSA batch verification. Our scheme does not need to compute modular inverse and at the same time, the security is preserved. We have included the performance evaluation to compare computational time between our scheme and the existed DSA batch verification.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 169, Issue 1, 1 October 2005, Pages 75-81
Journal: Applied Mathematics and Computation - Volume 169, Issue 1, 1 October 2005, Pages 75-81
نویسندگان
Chu-Hsing Lin, Ruei-Hau Hsu, Lein Harn,