New Parallel Architecture for Modular Multiplication and Squaring Based on Cellular Automata

Ku, Kyo-Min; Ha, Kyeoung Ju; Kim, Hyunsung; Yoo, Kee-Young

doi:10.1007/3-540-48051-x_36

Cited by 4 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this chapter, we show the architecture that simultaneously process the modular multiplication and squaring over GF(2 m ) in m clock cycles using a cellular automata [15].…”

Section: Multiplier/squarer Using the Cellular Automatamentioning

confidence: 99%

“…These two computations can be expressed in a recurrence form again [15]. First, the recurrence form of the modular multiplication is as follows:…”

Section: Multiplier/squarer Using the Cellular Automatamentioning

confidence: 99%

“…Therefore, a structure in which the exponentiation can be computed efficiently on GF(2 m ) by performing the modular multiplication and squaring simultaneously in the same amount of time as that of modular multiplication by computing T (i) (x)=T (i-1) (x)x mod P(x) for 1≤i≤m, which is the common part in equations 3 and 4, only once without duplicate computation, using the result, and obtaining the remaining part of equations 3 and 4 in parallel was proposed in [15].…”

Section: Step3 : T (I) (X)=t (I-1) (X)x Mod P(x)mentioning

confidence: 99%

See 2 more Smart Citations

Fast Exponentiaion over GF(2m) Based on Cellular Automata

Yoo

2003

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper, we present a new exponentiation architecture and multiplier/squarer which are the basic operations for exponentiation on GF(2 m ). The proposed multiplier/squarer is used as kernal architecture of exponentiation and processes the modular multiplication and squaring at the same time for effective exponentiation on GF(2 m ) using a cellular automata. Proposed architecture can be used efficiently for the design of the modular exponentiation on the finite field in most public key crypto systems such as Diffie-Hellman key exchange, ElGamal, etc. Also, the cellular automata architecture is simple, regular, modular, cascadable and therefore, can be utilized efficiently for the implementation of VLSI.

show abstract

“…In this chapter, we show the architecture that simultaneously process the modular multiplication and squaring over GF(2 m ) in m clock cycles using a cellular automata [15].…”

Section: Multiplier/squarer Using the Cellular Automatamentioning

confidence: 99%

“…These two computations can be expressed in a recurrence form again [15]. First, the recurrence form of the modular multiplication is as follows:…”

Section: Multiplier/squarer Using the Cellular Automatamentioning

confidence: 99%

Section: Step3 : T (I) (X)=t (I-1) (X)x Mod P(x)mentioning

confidence: 99%

See 1 more Smart Citation