Fast Reverse converter Design for three moduli set {2^n,2^n-1,2^(n-1)-1} Using CRTF

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:

Security is necessary for marine communication systems such as marine wireless sensor networks and automatic identification system which is the emerging system for automatic traffic control and collision avoidance services in the maritime transportation sector. Public key cryptography algorithms have an important role in these systems to realize secure communication systems. Public key cryptography algorithms such as RSA and Elliptic curve cryptography (ECC) have high computation costs and many works are done by researcher in order to speed up the operation. Residue number system which is a carry free system is widely used to speed up the operation in public key cryptography algorithm. In this paper, an improved RNS reverse converter for three-module set {2^n,2^n-1,2^(n-1)-1} using chinese reminder theorem with fractional is presented. Unit gate delay and area comparison of the proposed reverse converter with literature have confirmed that the proposed reverse conversion takes fewer hardware costs and higher speed.

Language:
English
Published:
International Journal of Coastal, Offshore and Environmental Engineering, Volume:7 Issue: 2, Spring 2022
Pages:
31 to 38
magiran.com/p2503986  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!