### Abstract

Elliptic curve cryptosystems are expected to be a next standard of public-key cryptosystems. A security level of elliptic curve cryptosystems depends on a difficulty of a discrete logarithm problem on elliptic curves. The security level of a elliptic curve cryptosystem which has a public-key of 160-bit is equivalent to that of a RSA system which has a public-key of 1024-bit. We propose an elliptic curve cryptosystem LSI architecture embedding word-based Montgomery multipliers. A Montgomery multiplication is an efficient method for a finite field multiplication. We can design a scalable architecture for an elliptic curve cryptosystem by selecting structure of word-based Montgomery multipliers. Experimental results demonstrate effectiveness and efficiency of the proposed architecture. In the hardware evaluation using 0.18 μ m CMOS library, the high-speed design using 126 Kgates with 20 × 8-bit multipliers achieved operation times of 3.6 ms for a 160-bit point multiplication.

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

Pages (from-to) | 243-249 |

Number of pages | 7 |

Journal | IEICE Transactions on Electronics |

Volume | E89-C |

Issue number | 3 |

DOIs | |

Publication status | Published - 2006 Jan 1 |

### Keywords

- Elliptic curve cryptosystem
- LSI design
- Montgmery multiplier
- Public-key cryptosystem

### ASJC Scopus subject areas

- Electronic, Optical and Magnetic Materials
- Electrical and Electronic Engineering

## Fingerprint Dive into the research topics of 'A fast elliptic curve cryptosystem LSI embedding word-based montgomery multiplier'. Together they form a unique fingerprint.

## Cite this

*IEICE Transactions on Electronics*,

*E89-C*(3), 243-249. https://doi.org/10.1093/ietele/e89-c.3.243