Implementing Pairings at the 192-Bit Security Level, Pairing-Based Cryptography ? Pairing 2012, pp.177-195, 2013. ,
DOI : 10.1007/978-3-642-36334-4_11
Faster Explicit Formulas for Computing Pairings over Ordinary Curves, Advances in Cryptology ? EUROCRYPT 2011, pp.48-68, 2011. ,
DOI : 10.1007/978-3-642-20465-4_5
Generic efficient arithmetic algorithms for PAFFs (processor adequate finite fields) and related algebraic structures (extended abstract ), Selected Areas in Cryptography ? SAC 2003, pp.320-334, 2004. ,
Efficient arithmetic in finite field extensions with applications in elliptic curve cryptography, Journal of Cryptology, vol.14, issue.3, pp.153-176, 2001. ,
A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic, Advances in Cryptology ? EUROCRYPT 2014, pp.1-16, 2014. ,
DOI : 10.1007/978-3-642-55220-5_1
URL : https://hal.archives-ouvertes.fr/hal-00835446
Batch Groth???Sahai, Applied Cryptography and Network Security ? ACNS 2010, pp.218-235, 2010. ,
DOI : 10.1007/978-3-642-13708-2_14
URL : https://hal.archives-ouvertes.fr/inria-00577167
A Variant of Miller???s Formula and Algorithm, Lecture Notes in Computer Science, vol.6487, pp.417-434, 2010. ,
DOI : 10.1007/978-3-642-17455-1_26
URL : https://hal.archives-ouvertes.fr/hal-01083368
On cryptographic protocols employing asymmetric pairings ??? The role of <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>??</mml:mi></mml:math> revisited, Discrete Applied Mathematics, vol.159, issue.13, pp.1311-1322, 2011. ,
DOI : 10.1016/j.dam.2011.04.021
A Taxonomy of Pairing-Friendly Elliptic Curves, Journal of Cryptology, vol.2, issue.5, pp.224-280, 2010. ,
DOI : 10.1007/s00145-009-9048-z
Pairings for cryptographers, Discrete Applied Mathematics, vol.156, issue.16, pp.3113-3121, 2008. ,
DOI : 10.1016/j.dam.2007.12.010
High Security Pairing-Based Cryptography Revisited, Algorithmic Number Theory ? ANTS-VII, pp.480-494, 2006. ,
DOI : 10.1007/11792086_34
Pairing Lattices, Lecture Notes in Computer Science, vol.5209, pp.18-38, 2008. ,
DOI : 10.1007/978-3-540-85538-5_2
The Eta Pairing Revisited, IEEE Transactions on Information Theory, vol.52, issue.10, pp.4595-4602, 2006. ,
DOI : 10.1109/TIT.2006.881709
Pairing-Based Cryptography at High Security Levels, Cryptography and Coding ? 10th IMA International Conference, pp.13-36, 2005. ,
DOI : 10.1007/11586821_2
The Weil pairing, and its efficient calculation, Journal of Cryptology, vol.17, pp.235-261, 2004. ,
Efficient Exponentiation in Extensions of Finite Fields without Fast Frobenius Mappings, ETRI Journal, vol.30, issue.6, pp.818-825, 2008. ,
DOI : 10.4218/etrij.08.0108.0178
Efficient pth root computations in finite fields of characteristic p. Designs, Codes and Cryptography, pp.351-358, 2009. ,
A family of implementation-friendly BN elliptic curves, Journal of Systems and Software, vol.84, issue.8, pp.1319-1326, 2011. ,
On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves, Pairing-Based Cryptography ? Pairing, pp.78-88, 2009. ,
DOI : 10.1007/3-540-36400-5_24
ECRYPT II yearly report on algorithms and keysizes European Network of Excellence in Cryptology II, 2009. ,
Optimal Pairings, IEEE Transactions on Information Theory, vol.56, issue.1, pp.455-461, 2010. ,
DOI : 10.1109/TIT.2009.2034881
On the Evaluation of Powers, SIAM Journal on Computing, vol.5, issue.1, pp.100-103, 1976. ,
DOI : 10.1137/0205008