Bit-Parallel Cubing Computation over GF(3m) for Irreducible Trinomials

被引：1

作者：

Park, Sun-Mi ^{[1
]}

Chang, Ku-Young ^{[2
]}

Hong, Dowon ^{[1
]}

Seo, Changho ^{[1
]}

机构：

[1] Kongju Natl Univ, Dept Appl Math, Gongju Si 314701, Chungnam, South Korea

[2] Elect & Telecommun Res Inst, Cryptog Res Sect, Taejon, South Korea

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2014年 / E97A卷 / 01期

基金：

新加坡国家研究基金会;

关键词：

finite field arithmetic; pth powering; -characteristic three; cubing; trinomial; cryptography; POLYNOMIAL BASIS; DUAL BASIS; ALGORITHMS;

D O I：

10.1587/transfun.E97.A.347

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We propose a parallel pth powering method over an arbitrary finite field GF(p(m)). Using the proposed method, we present the explicit formulae for the computation of cubing over a ternary field GF(3(m)) which is defined by irreducible trinomials. We show that the field cubing computation for irreducible trinomials, which plays an important role in calculating pairing, can be implemented very efficiently.

引用

页码：347 / 353

页数：7

共 50 条

[1] Bit-parallel systolic multiplier over GF(2m) for irreducible trinomials with ASIC and FPGA implementations
Mathe, Sudha Ellison
Boppanal, Lakshmi
[J]. IET CIRCUITS DEVICES & SYSTEMS, 2018, 12 (04) : 315 - 325
[2] Low complexity bit-parallel systolic multiplier over GF(2m) using irreducible trinomials
Lee, CY
[J]. IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2003, 150 (01): : 39 - 42
[3] Low-complexity bit-parallel square root computation over GF(2m) for all trinomials
Rodriguez-Henriquez, Francisco
Morales-Luna, Guillermo
Lopez, Julio
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2008, 57 (04) : 472 - 480
[4] Parallel GF(3m) multiplier for trinomials
Park, Sun-Mi
Chang, Ku-Young
Hong, Dowon
[J]. INFORMATION PROCESSING LETTERS, 2013, 113 (04) : 111 - 115
[5] Bit-parallel finite field multipliers for irreducible trinomials
Imaña, JL
Sánchez, JM
Tirado, F
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2006, 55 (05) : 520 - 533
[6] Low complexity bit-parallel squarer for GF(2n) defined by irreducible trinomials
Park, Sun-Mi
Chang, Ku-Young
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2006, E89A (09) : 2451 - 2452
[7] Compact bit-parallel systolic montgomery multiplication over GF(2m) generated by trinomials
Lee, Chiou-Yng
Chen, Chin-Chin
Lu, Erl-Huei
[J]. TENCON 2006 - 2006 IEEE REGION 10 CONFERENCE, VOLS 1-4, 2006, : 259 - 262
[8] Speedup of bit-parallel Karatsuba multiplier in GF(2m) generated by trinomials
Li, Yin
Chen, Gong-liang
Li, Jian-hua
[J]. INFORMATION PROCESSING LETTERS, 2011, 111 (08) : 390 - 394
[9] A Chinese Remainder Theorem Approach to Bit-Parallel GF(2n) Polynomial Basis Multipliers for Irreducible Trinomials
Fan, Haining
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2016, 65 (02) : 343 - 352
[10] Design and Implementation of a Novel Bit-Parallel Systolic Multiplier Over GF(2m) for Irreducible Pentanomials
Mathe, Sudha Ellison
Boppana, Lakshmi
[J]. JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2018, 27 (14)

← 1 2 3 4 5 →