کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4608981 1338395 2010 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On multiplication in finite fields
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات آنالیز ریاضی
پیش نمایش صفحه اول مقاله
On multiplication in finite fields
چکیده انگلیسی

We present a method for multiplication in finite fields which gives multiplication algorithms with improved or best known bilinear complexities for certain finite fields. Our method generalizes some earlier methods and combines them with the recently introduced complexity notion M̂q(ℓ), which denotes the minimum number of multiplications needed in FqFq in order to obtain the coefficients of the product of two arbitrary ℓℓ-term polynomials modulo xℓxℓ in Fq[x]Fq[x]. We study our method for the finite fields FqnFqn, where 2≤n≤182≤n≤18 and q=2,3,4q=2,3,4 and we improve or reach the currently best known bilinear complexities. We also give some applications in cryptography.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Complexity - Volume 26, Issue 2, April 2010, Pages 172–186
نویسندگان
, ,