کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10429193 | 909699 | 2005 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Isomorphism and Generation of Montgomery-Form Elliptic Curves Suitable for Cryptosystems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Many efficient algorithms of Montgomery-form elliptic curve cryptology have been investigated recently. At present, there are no reported studies of the isomorphic class of the Montgomery-form elliptic curve over a finite field. This paper investigates the isomorphism of Montgomery-form elliptic curves via the isomorphism of Weierstrass-form elliptic curves and gives a table of (nearly) all the forms of Montgomery-form elliptic curves suitable for cryptographic usage. Then, an algorithm for generating a secure elliptic curve with Montgomery-form is presented. The most important advantages of the new algorithm are that it avoids the transformation from an elliptic curve's Weierstrass-form to its Montgomery-form, and that it decreases the probability of collision. So, the proposed algorithem is quicker, simpler, and more efficient than the old ones.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Tsinghua Science & Technology - Volume 10, Issue 2, April 2005, Pages 145-151
Journal: Tsinghua Science & Technology - Volume 10, Issue 2, April 2005, Pages 145-151
نویسندگان
Liu (å é), Song (å® æ¶), Dai (æ´ä¸å¥),