More constructing pairing-friendly elliptic curves for cryptography

Simple item page
dc.creatorSatoru, Tanaka
dc.creatorKen, Nakamula
dc.date2007-11-13
dc.date.accessioned2026-07-07T08:42:37Z
dc.date.available2026-07-07T08:42:37Z
dc.descriptionThe 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.
dc.identifierhttps://arxiv.org/abs/0711.1942
dc.identifierhttp://arxiv.org/abs/0711.1942
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142021
dc.subjectNumber Theory
dc.subject11Y40
dc.titleMore constructing pairing-friendly elliptic curves for cryptography
dc.typetext

Files

Collections

arXiv