Subquadratic Polynomial Multiplication over GF(2m) Using Trinomial Bases and Chinese Remaindering

被引：0

作者：

Schost, Eric ^{[1
]}

Hariri, Arash ^{[2
]}

机构：

[1] Univ Western Ontario, Dept Comp Sci, ORCCA, London, ON, Canada

[2] Univ Western Ontario, Dept Elect & Comp Sci, London, ON, Canada

来源：

SELECTED AREAS IN CRYPTOGRAPHY | 2009年 / 5381卷

基金：

加拿大自然科学与工程研究理事会;

关键词：

Montgomery multiplication; Chinese remainder theorem; finite fields; subquadratic area complexity; MODULAR MULTIPLICATION; FIELDS; MULTIPLIERS; MONTGOMERY;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Following the previous work by Bajard-Didier-Kornerup, McLaughlin, Mihailescu and Bajard-Imbert-Jullien, we present an algorithm for modular polynomial multiplication that implements the Montgomery algorithm in a residue basis; here, as in Bajard et al.'s work, the moduli are trinomials over F-2. Previous work used a second residue basis to perform the final division. In this paper, we show how to keep the same residue basis, inspired by l'Hospital rule. Additionally, applying a divide-and-conquer approach to the Chinese remaindering, we obtain improved estimates on the number of additions for some useful degree ranges.

引用

页码：361 / +

页数：3

共 50 条

[31] Design and Implementation of a Polynomial Basis Multiplier Architecture Over GF(2m)
Ho, Huong
JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2014, 75 (03): : 203 - 208
[32] On comparison and analysis of algorithms for multiplication in GF(2m)
Korea Univ, Chung Nam, Korea, Republic of
J Comput Syst Sci, 3 (456-459):
[33] A Combined Circuit for Multiplication and Inversion in GF(2m)
Kobayashi, Katsuki
Takagi, Naofumi
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2008, 55 (11) : 1144 - 1148
[34] Concurrent error detection in a polynomial basis multiplier over GF(2m)
Lee, CY
Chiou, CW
Lin, JM
JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS, 2006, 22 (02): : 143 - 150
[35] A new construction of the irreducible polynomial for parallel multiplier over GF(2m)
Hwang, JH
Moon, KJ
Park, SY
Kim, HS
33RD INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, PROCEEDINGS, 2003, : 24 - 29
[36] A new construction of the irreducible polynomial for parallel multiplier over GF(2m)
Hwang, J.-H. (jhhwang@sports.re.kr), 1600, IEEE Computer Soc. Techn. Comm. on Multiple-Valued Logic; Japanese Research Group on Multiple-Valued Logic; Meiji University (Institute of Electrical and Electronics Engineers Computer Society):
[37] Design and Implementation of a Sequential Polynomial Basis Multiplier over GF(2m)
Mathe, Sudha Ellison
Boppana, Lakshmi
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2017, 11 (05): : 2680 - 2700
[38] Design and Implementation of a Polynomial Basis Multiplier Architecture Over GF(2m)
Huong Ho
Journal of Signal Processing Systems, 2014, 75 : 203 - 208
[39] Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2m)
Chiou-Yng Lee
Che Wun Chiou
Jim-Min Lin
Journal of Electronic Testing, 2006, 22 : 143 - 150
[40] DIVISION OVER GF(2M)
FENN, STJ
TAYLOR, D
BENAISSA, M
ELECTRONICS LETTERS, 1992, 28 (24) : 2259 - 2261

← 1 2 3 4 5 →