### Abstract

It has recently been reported that the performance of hyperelliptic curve cryptosystems (HECC) is competitive to that of elliptic curve cryptosystems (ECC). Concerning the security of HECC, the theta divisors play an important role. The scalar multiplication using a random base point is vulnerable to an exceptional procedure attack, which is a kind of side-channel attacks, using theta divisors. In the case of cryptographic protocols of the scalar multiplication using fixed base point, however, the exceptional procedure attack is not applicable. First, we present novel efficient scalar multiplication using theta divisors, which is the positive application of theta divisors on HECC. Second, we develop a window-based method using theta divisors that is secure against side-channel attacks. It is not obvious how to construct a base point D such that all pre-computed points are theta divisors. We present an explicit algorithm for generating such divisors.

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

Pages (from-to) | 151-160 |

Number of pages | 10 |

Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |

Volume | E89-A |

Issue number | 1 |

DOIs | |

Publication status | Published - Jan 1 2006 |

### All Science Journal Classification (ASJC) codes

- Signal Processing
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Efficient hyperelliptic curve cryptosystems using theta divisors'. Together they form a unique fingerprint.

## Cite this

*IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences*,

*E89-A*(1), 151-160. https://doi.org/10.1093/ietfec/e89-a.1.151