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 条

[21] FPGA Realization of Low Register Systolic All-One-Polynomial Multipliers Over GF(2m) and Their Applications in Trinomial Multipliers
Chen, Pingxiuqi
Basha, Shaik Nazeem
Mozaffari-Kermani, Mehran
Azarderakhsh, Reza
Xie, Jiafeng
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2017, 25 (02) : 725 - 734
[22] Efficient Subquadratic Space Complexity Digit-Serial Multipliers over GF(2m) based on Bivariate Polynomial Basis Representation
Lee, Chiou-Yng
Xie, Jiafeng
2020 25TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, ASP-DAC 2020, 2020, : 253 - 258
[23] VLSI DESIGNS FOR MULTIPLICATION OVER FINITE-FIELDS GF(2M)
MASTROVITO, ED
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 357 : 297 - 309
[24] SYSTOLIC ARCHITECTURES FOR MULTIPLICATION OVER FINITE-FIELD GF(2M)
DIAB, M
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 508 : 327 - 340
[25] Semi-systolic architecture for modular multiplication over GF(2m)
Kim, HS
Jeon, IS
COMPUTATIONAL SCIENCE - ICCS 2005, PT 3, 2005, 3516 : 912 - 915
[26] Efficient implementation of bit-parallel fault tolerant polynomial basis multiplication and squaring over GF(2m)
Rashidi, Bahram
Sayedi, Sayed Masoud
Farashahi, Reza Rezaeian
IET COMPUTERS AND DIGITAL TECHNIQUES, 2016, 10 (01): : 18 - 29
[27] Fast multiplication on elliptic curves over GF(2m) without precomputation
López, J
Dahab, R
CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS, 1999, 1717 : 316 - 327
[28] Low complexity systolic architecture for modular multiplication over GF(2m)
Kim, Hyun-Sung
Lee, Sung-Woon
COMPUTATIONAL SCIENCE - ICCS 2006, PT 1, PROCEEDINGS, 2006, 3991 : 634 - 640
[29] FPGA Implementation of Energy Efficient Multiplication over GF(2m) for ECC
Kodali, Ravi Kishore
Boppana, Lakshmi
2014 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2014, : 1815 - 1821
[30] Two systolic architectures for multiplication in GF(2m)
Tsai, WC
Wang, SJ
IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2000, 147 (06): : 375 - 382

← 1 2 3 4 5 →