### Abstract

Pairing-based schemes, such as identity-based cryptosystem, are widely used for future computing environments. Hence the work of hardware architectures for GF(p^{m}) has been brought to public attention for the past few years since most of the pairing-based schemes are implemented using arithmetic operations over GF(p^{m}) defined by irreducible trinomials. This paper proposes a new most significant elements (MSE)-first serial multiplier for GF(p^{m}), where p > 2, which is more efficient than least significant elements (LSE)-first multipliers from the point of view of both the time delay and the size of registers. In particular, the proposed multiplier has an advantage when the extension degree of finite fields m is large and the characteristic of finite fields p is small like GF(3^{m}), GF(5 ^{m}), and GF(7^{m}) used in pairing-based cryptosystems.

Original language | English |
---|---|

Pages (from-to) | 355-361 |

Number of pages | 7 |

Journal | Computers and Mathematics with Applications |

Volume | 60 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2010 Jul 1 |

### Keywords

- Bit-serial multiplier
- Finite field
- Irreducible trinomial
- Pairing-based cryptography

### ASJC Scopus subject areas

- Modelling and Simulation
- Computational Theory and Mathematics
- Computational Mathematics

## Fingerprint Dive into the research topics of 'A new bit-serial multiplier over GF(p<sup>m</sup>) using irreducible trinomials'. Together they form a unique fingerprint.

## Cite this

^{m}) using irreducible trinomials.

*Computers and Mathematics with Applications*,

*60*(2), 355-361. https://doi.org/10.1016/j.camwa.2009.12.034