{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:35:32Z","timestamp":1761060932710,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T00:00:00Z","timestamp":1576540800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T00:00:00Z","timestamp":1576540800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s42979-019-0053-5","type":"journal-article","created":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T10:23:17Z","timestamp":1576578197000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast Hashing to $${\\mathbb {G}}_{2}$$ on Aurifeuillean Pairing-Friendly Elliptic Curves"],"prefix":"10.1007","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7729-0419","authenticated-orcid":false,"given":"Emmanuel","family":"Fouotsa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurian","family":"Azebaze Guimagang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,17]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Boneh D, Franklin MK. Identity-based encryption from the weil pairing. In: Advances in cryptology. 2001. p. 213\u201329. https:\/\/doi.org\/10.1007\/3-540-44647-8_13.","key":"53_CR1","DOI":"10.1007\/3-540-44647-8_13"},{"issue":"4","key":"53_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D Boneh","year":"2004","unstructured":"Boneh D, Lynn B, Shacham H. Short signatures from the weil pairing. J Cryptol. 2004;17(4):297\u2013319. https:\/\/doi.org\/10.1007\/s00145-004-0314-9.","journal-title":"J Cryptol"},{"doi-asserted-by":"publisher","unstructured":"Joux A. A one round protocol for tripartite Diffie\u2013Hellman. In: Algorithmic number theory. 2000. p. 385\u201394. https:\/\/doi.org\/10.1007\/10722028_23.","key":"53_CR3","DOI":"10.1007\/10722028_23"},{"key":"53_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics","author":"JH Silvermann","year":"1986","unstructured":"Silvermann JH. The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics, vol. 106. New York: Springer; 1986."},{"issue":"4","key":"53_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"VS Miller","year":"2004","unstructured":"Miller VS. The weil pairing, and its efficient calculation. J Cryptol. 2004;17(4):235\u201361. https:\/\/doi.org\/10.1007\/s00145-004-0315-8.","journal-title":"J Cryptol"},{"doi-asserted-by":"publisher","unstructured":"Blake IF, Murty VK, Xu G. Refinements of miller\u2019s algorithm for computing the weil\/tate pairing. J Algorithms 2006;58(2):134\u2013149 . https:\/\/doi.org\/10.1016\/j.jalgor.2005.01.009. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0196677405000271.","key":"53_CR6","DOI":"10.1016\/j.jalgor.2005.01.009"},{"issue":"10","key":"53_CR7","doi-asserted-by":"publisher","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F Hess","year":"2006","unstructured":"Hess F, Smart NP, Vercauteren F. The eta pairing revisited. IEEE Trans Inf Theory. 2006;52(10):4595\u2013602.https:\/\/doi.org\/10.1109\/TIT.2006.881709.","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"53_CR8","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1109\/TIT.2009.2013048","volume":"55","author":"E Lee","year":"2009","unstructured":"Lee E, Lee H, Park C. Efficient and generalized pairing computation on abelian varieties. IEEE Trans Inf Theory. 2009;55(4):1793\u2013803.","journal-title":"IEEE Trans Inf Theory"},{"doi-asserted-by":"publisher","unstructured":"Scott M, Benger N, Charlemagne M, Dominguez LJ, Kachisa EJ. Fast hashing to $${\\mathbb{G}} _{2}$$ on pairing-friendly curves. In: Pairing-based cryptography\u2014pairing. 2009. p. 102\u201313. https:\/\/doi.org\/10.1007\/978-3-642-03298-1_8.","key":"53_CR9","DOI":"10.1007\/978-3-642-03298-1_8"},{"doi-asserted-by":"publisher","unstructured":"Casta\u00f1eda LF, Knapp E, Rodr\u00edguez-Henr\u00edquez F. Faster hashing to $${\\mathbb{G}}_{2}$$. In: Selected areas in cryptography. 2011. p. 412\u201330. https:\/\/doi.org\/10.1007\/978-3-642-28496-0_25.","key":"53_CR10","DOI":"10.1007\/978-3-642-28496-0_25"},{"issue":"3","key":"53_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/3313880.3313884","volume":"52","author":"A Budroni","year":"2018","unstructured":"Budroni A, Pintore F. Hashing to G2 on BLS pairing-friendly curves. ACM Commun Comput Algebra. 2018;52(3):63\u20136. https:\/\/doi.org\/10.1145\/3313880.3313884.","journal-title":"ACM Commun Comput Algebra"},{"doi-asserted-by":"publisher","unstructured":"Scott M, Guillevic A. A new family of pairing-friendly elliptic curves. 2018. p. 43\u201357. https:\/\/doi.org\/10.1007\/978-3-030-05153-2_2.","key":"53_CR12","DOI":"10.1007\/978-3-030-05153-2_2"},{"key":"53_CR13","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0196-6774(81)90003-1","volume":"2","author":"J Olivos","year":"1981","unstructured":"Olivos J. On vectorial addition chains. J Algorithms. 1981;2:13\u201321.","journal-title":"J Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Galbraith S, Scott M. Exponentiation in pairing-friendly groups using homomorphisms. In: Pairing-based cryptography\u2014pairing. Berlin: Springer; 2008. p. 211\u201324.","key":"53_CR14","DOI":"10.1007\/978-3-540-85538-5_15"},{"key":"53_CR15","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/BFb0054893","volume-title":"Algorithmic number theory","author":"S Paulus","year":"1998","unstructured":"Paulus S. Lattice basis reduction in function fields. In: Buhler JP, editor. Algorithmic number theory. Berlin: Springer; 1998. p. 567\u201375."},{"doi-asserted-by":"crossref","unstructured":"Mrabet NE, Joye M. Guide to pairing-based cryptography. Chapman and Hall\/CRC cryptography and network security 2016.","key":"53_CR16","DOI":"10.1201\/9781315370170"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-019-0053-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s42979-019-0053-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-019-0053-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,16]],"date-time":"2020-12-16T01:29:52Z","timestamp":1608082192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s42979-019-0053-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,17]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["53"],"URL":"https:\/\/doi.org\/10.1007\/s42979-019-0053-5","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"type":"print","value":"2662-995X"},{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2019,12,17]]},"assertion":[{"value":"1 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"51"}}