Algorithm Design and Theoretical Analysis of a New Bit Forwarding Large Integer Modular Exponentiation Algorithm
Publish place: Computational Sciences and Engineering، Vol: 2، Issue: 2
Publish Year: 1401
نوع سند: مقاله ژورنالی
زبان: English
View: 41
This Paper With 12 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_CSE-2-2_010
تاریخ نمایه سازی: 5 اسفند 1402
Abstract:
One of the most principal operations in many PKCs is Modular Exponentiation (ME). This operation is usually performed by successive modular multiplications. So, the efficiency of these PKCs is released on the efficiency of the Modular Multiplication (M۲) and modular exponentiation implementation. Therefore, it is essential to minimize the execution time of the M۲ and the number of required M۲ for performing the ME operation. This paper proposes a novel ME algorithm. In the developed algorithm, the Bit Forwarding (BF) and multibit-scan-multibit-shift techniques are employed for the performance improvement in the ME operation. The complexity analysis is accomplished to show that the developed exponentiation algorithm has benefit in the number of required multiplications. The results indicate that the presented algorithm improves the results compared to other modular exponentiation algorithms by about ۱۱%-۸۵%.
Keywords:
Authors
Abdalhossein Rezai
Department of Electrical Engineering, University of Science and Culture, Tehran, Iran
Manizheh Abbasi
ACECR Institute of Higher Education, Isfahan Branch, Isfahan, Iran
Asghar Karimi
ACECR Institute of Higher Education, Isfahan Branch, Isfahan, Iran
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :