ScholarLens Back to search
2008•Computer Engineering and ScienceRequires access

A New Algorithm for the Exponentiation over GF(2~m) in the Limited Domain

Hu Jin

Open publisher page 0 citations

Abstract

A new algorithm is proposed for the exponentiation over GF(2m) in the limited domain.Compared with the classic square-and-multiply algorithm,the proposed algorithm is shown to save 33% multiplications over GF(2m) in most cases with a little precomputation.

About this research paper

What this paper is about

A new algorithm is proposed for the exponentiation over GF(2m) in the limited domain.Compared with the classic square-and-multiply algorithm,the proposed algorithm is shown to save 33% multiplications over GF(2m) in most cases with a little precomputation.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A new algorithm is proposed for the exponentiation over GF(2m) in the limited domain.Compared with the classic square-and-multiply algorithm,the proposed algorithm is shown to save 33% multiplications over GF(2m) in most cases with a little precomputation.

Key concepts: Precomputation, Exponentiation, Computer science, GF(2), Algorithm, Modular exponentiation, Domain (mathematical analysis), Square (algebra)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A New Algorithm for the Exponentiation over GF(2~m) in the Limited Domain — Research Paper | ScholarLens