Afficher la notice abrégée

An Algebraic Point of View on the Generation of Pairing-Friendly Curves

hal.structure.identifierAnalyse cryptographique et arithmétique [CANARI]
hal.structure.identifierLithe and fast algorithmic number theory [LFANT]
dc.contributor.authorGASNIER, Jean
hal.structure.identifierCryptology, arithmetic : algebraic methods for better algorithms [CARAMBA]
dc.contributor.authorGUILLEVIC, Aurore
dc.date.accessioned2024-04-04T02:33:17Z
dc.date.available2024-04-04T02:33:17Z
dc.date.created2023-09-13
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/190462
dc.description.abstractEnIn 2010, Freeman, Scott, and Teske published a well-known taxonomy compiling the best known families of pairing-friendly elliptic curves. Since then, the research effort mostly shifted from the generation of pairing-friendly curves to the improvement of algorithms or the assessment of security parameters to resist the latest attacks on the discrete logarithm problem. Consequently, very few new families were discovered. However, the need of pairing-friendly curves of prime order in some new applications such as SNARKs has reignited the interest in the generation of pairing-friendly curves, with hope of finding families similar to the one discovered by Barreto and Naehrig. Building on the work of Kachisa, Schaefer, and Scott, we show that some elements of extensions of a cyclotomic field have a higher probability of generating a family of pairing-friendly curves. We present a general framework which embraces the KSS families and many of the other families in the taxonomy paper, and provide an open-source SageMath implementation of our technique. We finally introduce a new family with embedding degree k = 20 which we estimate to provide a faster Miller loop compared to KSS16 and KSS18 at the 192-bit security level.
dc.language.isoen
dc.subject.enElliptic Curves
dc.subject.enPairing-based Cryptography
dc.title.enAn Algebraic Point of View on the Generation of Pairing-Friendly Curves
dc.typeDocument de travail - Pré-publication
dc.subject.halInformatique [cs]/Cryptographie et sécurité [cs.CR]
dc.subject.halMathématiques [math]/Théorie des nombres [math.NT]
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
hal.identifierhal-04205681
hal.version1
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-04205681v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=GASNIER,%20Jean&GUILLEVIC,%20Aurore&rft.genre=preprint


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée