Affordable Access

More constructing pairing-friendly elliptic curves for cryptography

Authors
  • Satoru, Tanaka
  • Ken, Nakamula
Type
Preprint
Publication Date
Nov 13, 2007
Submission Date
Nov 13, 2007
Source
arXiv
License
Unknown
External links

Abstract

The problem of constructing elliptic curves suitable for pairing applications has received a lot of attention. To solve this, we propose a variant algorithm of a known method by Brezing and Weng. We produce new families of parameters using our algorithm for pairing-friendly elliptic curves of embedding degree 8, and we actually compute some explicit curves as numerical examples.

Report this publication

Statistics

Seen <100 times