,
, BLS, p.427
RELIC is an Efficient LIbrary for Cryptography ,
Faster explicit formulas for computing pairings over ordinary curves, EUROCRYPT 2011, vol.6632, pp.48-68, 2011. ,
Updating key size estimations for pairings, Journal of Cryptology, vol.32, issue.4, pp.1298-1336, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01534101
A taxonomy of pairings, their security, their complexity, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02129868
The tower number field sieve, ASIACRYPT 2015, Part II, vol.9453, pp.31-55 ,
URL : https://hal.archives-ouvertes.fr/hal-01155635
Constructing elliptic curves with prescribed embedding degrees, SCN 02, vol.2576, pp.257-267, 2003. ,
Pairing-friendly elliptic curves of prime order, SAC 2005, vol.3897, pp.319-331, 2006. ,
, New zk-SNARK elliptic curve construction. Zcash blog, pp.12-381, 2017.
Zexe: Enabling decentralized private computation. Cryptology ePrint Archive, vol.962, 2018. ,
Elliptic curves suitable for pairing based cryptography, Des. Codes Cryptogr, vol.37, issue.1, pp.133-141, 2005. ,
On instantiating pairing-based protocols with elliptic curves of embedding degree one, IEEE Trans. Computers, vol.66, issue.6, pp.1061-1070, 2017. ,
Efficient computation of Tate pairing in projective coordinate over general characteristic fields, ICISC 04, vol.3506, pp.168-181, 2005. ,
On cycles of pairing-friendly elliptic curves, SIAM Journal on Applied Algebra and Geometry, vol.3, issue.2, pp.175-192, 2019. ,
Faster pairing computations on curves with high-degree twists, PKC 2010, vol.6056, pp.224-242, 2010. ,
Attractive subfamilies of BLS curves for implementing high-security pairings, DOCRYPT 2011, vol.7107, pp.320-342, 2011. ,
,
HT90 and "simplest" number fields, Illinois J. Math, vol.55, issue.4, pp.1621-1655, 2011. ,
TNFS resistant families of pairing-friendly elliptic curves, Theoretical Computer Science, 2019. ,
Optimal TNFS-secure pairings on elliptic curves with composite embedding degree, Cryptology ePrint Archive, vol.555, 2019. ,
Computing optimal ate pairings on elliptic curves with embedding degree 9, 15 and 27. Cryptology ePrint Archive, 1187. ,
A taxonomy of pairing-friendly elliptic curves, Journal of Cryptology, vol.23, issue.2, pp.224-280, 2010. ,
, Advances in Elliptic Curve Cryptography, pp.183-214, 2005.
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation. Cryptology ePrint Archive, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02305051
On the alpha value of polynomials in the tower number field sieve algorithm. Cryptology ePrint Archive, vol.885, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02263098
, Elliptic curve generation, 2 edn, ISO/IEC 15946-5:2017 Information technology -Security techniques -Cryptographic techniques based on elliptic curves -Part, vol.5, 2017.
The special number field sieve in Fpn -application to pairingfriendly constructions, PAIRING 2013, vol.8365, pp.45-61, 2014. ,
Constructing Brezing-Weng pairing-friendly elliptic curves using elements in the cyclotomic field, PAIRING 2008, vol.5209, pp.126-135, 2008. ,
Extended tower number field sieve: A new complexity for the medium prime case, CRYPTO 2016, Part I. LNCS, vol.9814, pp.543-571, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01281966
Extended tower number field sieve with application to finite fields of arbitrary composite extension degree, Part I. LNCS, vol.10174, pp.388-408, 2017. ,
Selecting cryptographic key sizes, Journal of Cryptology, vol.14, issue.4, pp.255-293, 2001. ,
Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography, Mycrypt Conference, Revised Selected Papers, vol.10311, pp.83-108 ,
, , 2016.
Five, six, and seven-term Karatsuba-like formulae, IEEE Transactions on Computers, vol.54, pp.362-369, 2005. ,
A family of implementation-friendly BN elliptic curves, Journal of Systems and Software, vol.84, issue.8, pp.1319-1326, 2011. ,
Pairing-friendly curves, draftyonezawa-pairing-friendly-curves-02, Arithmetic of Finite Fields, pp.43-57, 2018. ,
Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians, Contemporary mathematics, vol.637, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-00874925
Fast and simple constant-time hashing to the BLS12-381 elliptic curve, IACR Transactions on Cryptographic Hardware and Embedded Systems, vol.2019, issue.4, pp.154-179, 2019. ,