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 条
12345