A new method for optimizing cubic arithmetic circuit in GF(3m)

Xiao Ding Wang; Zhen Fu Cao

A new method for optimizing cubic arithmetic circuit in GF(3^m)

Xiao Ding Wang
, Zhen Fu Cao^*

^*此作品的通讯作者

Shanghai Jiao Tong University

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

This paper proposed a new method for generating an optimized circuit for cubic arithmetic in Galois field GF(3^m). After applying the method on 580 different cubic arithmetic circuits in Galois field GF(3^m), the statistical data shows that for x^m+p_tx^t+x₀, m<256 most irreducible polynomials, our method can generate a cubic arithmetic circuit with less than 1.35 m adders. For 212 irreducible polynomials, our method can generate a cubic arithmetic circuit with less than m adders.

源语言	英语
页（从-至）	1741-1745
页数	5
期刊	Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University
卷	46
期	11
出版状态	已出版 - 11月 2012
已对外发布	是

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{998b74cda51e47cbb9da31683c16d422,

title = "A new method for optimizing cubic arithmetic circuit in GF(3m)",

abstract = "This paper proposed a new method for generating an optimized circuit for cubic arithmetic in Galois field GF(3m). After applying the method on 580 different cubic arithmetic circuits in Galois field GF(3m), the statistical data shows that for xm+ptxt+x0, m<256 most irreducible polynomials, our method can generate a cubic arithmetic circuit with less than 1.35 m adders. For 212 irreducible polynomials, our method can generate a cubic arithmetic circuit with less than m adders.",

keywords = "Circuit design, Cubic arithmetic, Galois field, Optimization, Tate pairing",

author = "Wang, \{Xiao Ding\} and Cao, \{Zhen Fu\}",

year = "2012",

month = nov,

language = "英语",

volume = "46",

pages = "1741--1745",

journal = "Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University",

issn = "1006-2467",

publisher = "Shanghai Jiaotong University",

number = "11",

}

TY - JOUR

T1 - A new method for optimizing cubic arithmetic circuit in GF(3m)

AU - Wang, Xiao Ding

AU - Cao, Zhen Fu

PY - 2012/11

Y1 - 2012/11

N2 - This paper proposed a new method for generating an optimized circuit for cubic arithmetic in Galois field GF(3m). After applying the method on 580 different cubic arithmetic circuits in Galois field GF(3m), the statistical data shows that for xm+ptxt+x0, m<256 most irreducible polynomials, our method can generate a cubic arithmetic circuit with less than 1.35 m adders. For 212 irreducible polynomials, our method can generate a cubic arithmetic circuit with less than m adders.

AB - This paper proposed a new method for generating an optimized circuit for cubic arithmetic in Galois field GF(3m). After applying the method on 580 different cubic arithmetic circuits in Galois field GF(3m), the statistical data shows that for xm+ptxt+x0, m<256 most irreducible polynomials, our method can generate a cubic arithmetic circuit with less than 1.35 m adders. For 212 irreducible polynomials, our method can generate a cubic arithmetic circuit with less than m adders.

KW - Circuit design

KW - Cubic arithmetic

KW - Galois field

KW - Optimization

KW - Tate pairing

UR - https://www.scopus.com/pages/publications/84871958503

M3 - 文章

AN - SCOPUS:84871958503

SN - 1006-2467

VL - 46

SP - 1741

EP - 1745

JO - Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University

JF - Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University

IS - 11

ER -

A new method for optimizing cubic arithmetic circuit in GF(3m)

摘要

其它文件与链接

指纹

引用此

A new method for optimizing cubic arithmetic circuit in GF(3^m)