Projects per year

## Abstract

In this paper we simplify and extend the Eta pairing, originally discovered in the setting of supersingular curves by Barreto et al., to ordinary curves. Furthermore, we show that by swapping the arguments of the Eta pairing, one obtains a very efficient algorithm resulting in a speed-up of a factor of around six over the usual Tate pairing, in the case of curves which have large security parameters, complex multiplication by an order of $\Q(\sqrt{-3})$, and when the trace of Frobenius is chosen to be suitably small.
Other, more minor savings are obtained for more general curves.

Translated title of the contribution | The Eta pairing revisited |
---|---|

Original language | English |

Pages (from-to) | 4595 - 4602 |

Number of pages | 8 |

Journal | IEEE Transactions on Information Theory |

Volume | 52 (10) |

DOIs | |

Publication status | Published - Oct 2006 |

### Bibliographical note

Publisher: IEEE## Fingerprint

Dive into the research topics of 'The Eta pairing revisited'. Together they form a unique fingerprint.## Projects

- 1 Finished