Formulas for cube roots in F 3 m using shifted polynomial basis

Young In Cho, Nam Su Chang, Seokhie Hong

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Evaluation of cube roots in characteristic three finite fields is required for Tate (or modified Tate) pairing computation. The Hamming weight of x1 /3 means that the number of nonzero coefficients in the polynomial representation of x1/3 in F3m= F3[x]/(f), where fâ̂̂F3[x] is an irreducible polynomial. The Hamming weight of x1/3 determines the efficiency of cube roots computation for characteristic three finite fields. Ahmadi et al. found the Hamming weight of x1/3 using polynomial basis [4]. In this paper, we observe that shifted polynomial basis (SPB), a variation of polynomial basis, can reduce Hamming weights of x1/3 and x2 /3. Moreover, we provide the suitable SPB that eliminates modular reduction process in cube roots computation.

Original languageEnglish
Pages (from-to)331-337
Number of pages7
JournalInformation Processing Letters
Volume114
Issue number6
DOIs
Publication statusPublished - 2014 Jun 1

Fingerprint

Cube root
Hamming Weight
Polynomial Basis
Polynomials
Galois field
Tate Pairing
Irreducible polynomial
Eliminate
Polynomial
Evaluation
Coefficient

Keywords

  • Cryptography
  • Cube roots
  • Finite field arithmetic
  • Shifted polynomial basis

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Signal Processing
  • Theoretical Computer Science

Cite this

Formulas for cube roots in F 3 m using shifted polynomial basis. / Cho, Young In; Chang, Nam Su; Hong, Seokhie.

In: Information Processing Letters, Vol. 114, No. 6, 01.06.2014, p. 331-337.

Research output: Contribution to journalArticle

Cho, Young In ; Chang, Nam Su ; Hong, Seokhie. / Formulas for cube roots in F 3 m using shifted polynomial basis. In: Information Processing Letters. 2014 ; Vol. 114, No. 6. pp. 331-337.
@article{535e22a0fed3448492d062ebc9e451c8,
title = "Formulas for cube roots in F 3 m using shifted polynomial basis",
abstract = "Evaluation of cube roots in characteristic three finite fields is required for Tate (or modified Tate) pairing computation. The Hamming weight of x1 /3 means that the number of nonzero coefficients in the polynomial representation of x1/3 in F3m= F3[x]/(f), where f{\^a}̂̂F3[x] is an irreducible polynomial. The Hamming weight of x1/3 determines the efficiency of cube roots computation for characteristic three finite fields. Ahmadi et al. found the Hamming weight of x1/3 using polynomial basis [4]. In this paper, we observe that shifted polynomial basis (SPB), a variation of polynomial basis, can reduce Hamming weights of x1/3 and x2 /3. Moreover, we provide the suitable SPB that eliminates modular reduction process in cube roots computation.",
keywords = "Cryptography, Cube roots, Finite field arithmetic, Shifted polynomial basis",
author = "Cho, {Young In} and Chang, {Nam Su} and Seokhie Hong",
year = "2014",
month = "6",
day = "1",
doi = "10.1016/j.ipl.2014.01.001",
language = "English",
volume = "114",
pages = "331--337",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "6",

}

TY - JOUR

T1 - Formulas for cube roots in F 3 m using shifted polynomial basis

AU - Cho, Young In

AU - Chang, Nam Su

AU - Hong, Seokhie

PY - 2014/6/1

Y1 - 2014/6/1

N2 - Evaluation of cube roots in characteristic three finite fields is required for Tate (or modified Tate) pairing computation. The Hamming weight of x1 /3 means that the number of nonzero coefficients in the polynomial representation of x1/3 in F3m= F3[x]/(f), where fâ̂̂F3[x] is an irreducible polynomial. The Hamming weight of x1/3 determines the efficiency of cube roots computation for characteristic three finite fields. Ahmadi et al. found the Hamming weight of x1/3 using polynomial basis [4]. In this paper, we observe that shifted polynomial basis (SPB), a variation of polynomial basis, can reduce Hamming weights of x1/3 and x2 /3. Moreover, we provide the suitable SPB that eliminates modular reduction process in cube roots computation.

AB - Evaluation of cube roots in characteristic three finite fields is required for Tate (or modified Tate) pairing computation. The Hamming weight of x1 /3 means that the number of nonzero coefficients in the polynomial representation of x1/3 in F3m= F3[x]/(f), where fâ̂̂F3[x] is an irreducible polynomial. The Hamming weight of x1/3 determines the efficiency of cube roots computation for characteristic three finite fields. Ahmadi et al. found the Hamming weight of x1/3 using polynomial basis [4]. In this paper, we observe that shifted polynomial basis (SPB), a variation of polynomial basis, can reduce Hamming weights of x1/3 and x2 /3. Moreover, we provide the suitable SPB that eliminates modular reduction process in cube roots computation.

KW - Cryptography

KW - Cube roots

KW - Finite field arithmetic

KW - Shifted polynomial basis

UR - http://www.scopus.com/inward/record.url?scp=84894262735&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84894262735&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2014.01.001

DO - 10.1016/j.ipl.2014.01.001

M3 - Article

VL - 114

SP - 331

EP - 337

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 6

ER -