کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6874226 1441030 2018 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Fast modular reduction and squaring in GF(2m)
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Fast modular reduction and squaring in GF(2m)
چکیده انگلیسی
We present an efficient bit-parallel algorithm for squaring in GF(2m) using polynomial basis. This algorithm achieves competitive efficiency while being aimed at any choice of low-weight irreducible polynomial. For a large class of irreducible polynomials it is more efficient than the previously best general squarer. In contrast, other efficient squarers often require a change of basis or are suitable for only a small number of irreducible polynomials. Additionally, we present a simple algorithm for modular reduction with equivalent cost to the state of the art for general irreducible polynomials. This fast reduction is used in our squaring method.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Processing Letters - Volume 132, April 2018, Pages 33-38
نویسندگان
, , ,