Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure

Yen, Sung-Ming; Chen, Chien-Ning; Moon, SangJae

doi:10.1007/s13389-012-0032-4

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2018

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sun et al analyzed the computational efficiency of Wu et al's algorithm [13] by modeling it as a Markov chain [14]. Yen et al [15] presented a series of algorithms for the computation of multi exponentiation. These algorithms are based on the binary greatest common divisor algorithm.…”

Section: Introductionmentioning

confidence: 99%

Speeding Up Multi- Exponentiation Algorithm on a Multicore System

Fathy

Bahig

Farag

2018

Journal of the Egyptian Mathematical Society

View full text Add to dashboard Cite

A public key cryptosystem is a basic tool to protect data security. Most public key cryptosystem schemes include time consuming operations such as the modular multi exponentiation. To address this problem, a new parallel algorithm for the modular multi exponentiation is introduced. The proposed algorithm is based on parallelizing the binary method. The experimental study on a multicore system shows that the running time of the proposed algorithm is smaller than the previous parallel algorithm in the cases of large data sizes under different number of processors. The percentage of improvement is up to 55% compared with the previous algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%