کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6871280 | 1440182 | 2018 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Low complexity bit-parallel multiplier for F2n defined by repeated polynomials
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Wu recently proposed three types of irreducible polynomials for low-complexity bit-parallel multipliers over F2n. In this paper, we consider new classes of irreducible polynomials for low-complexity bit-parallel multipliers over F2n, namely, repeated polynomial (RP). The complexity of the proposed multipliers is lower than those based on irreducible pentanomials. A repeated polynomial can be classified by the complexity of bit-parallel multiplier based on RPs, namely, C1, C2 and C3. If we consider finite fields that have neither a ESP nor a trinomial as an irreducible polynomial when nâ¤1000, then, in Wu's result, only 11 finite fields exist for three types of irreducible polynomials when nâ¤1000. However, in our result, there are 181, 232(52.4%), and 443(100%) finite fields of class C1, C2 and C3, respectively.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 241, 31 May 2018, Pages 2-12
Journal: Discrete Applied Mathematics - Volume 241, 31 May 2018, Pages 2-12
نویسندگان
Nam Su Chang, Eun Sook Kang, Seokhie Hong,