{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:57:10Z","timestamp":1725569830245},"publisher-location":"Berlin, Heidelberg","reference-count":47,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174544"},{"type":"electronic","value":"9783642174551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17455-1_14","type":"book-chapter","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T15:31:49Z","timestamp":1290007909000},"page":"207-224","source":"Crossref","is-referenced-by-count":0,"title":["Designing a Code Generator for Pairing Based Cryptographic Functions"],"prefix":"10.1007","author":[{"given":"Luis J.","family":"Dominguez Perez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Scott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Multi-precision libraries for submissions for the Nessie project, https:\/\/www.cosic.esat.kuleuven.be\/nessie\/call\/mplibs.html","key":"14_CR1"},{"unstructured":"Abusharekh, A.: Comparative analysis of multi-precision arithmetic libraries for Public Key Cryptography. Master\u2019s thesis, George Mason University (April 2004)","key":"14_CR2"},{"unstructured":"Aranha, D.F., Porto Lopes Gouv\u00eaa, C.: RELIC: an efficient library for cryptography, http:\/\/code.google.com\/p\/relic-toolkit\/","key":"14_CR3"},{"unstructured":"LG at the Darmstadt University\u00a0of Technology. Lidia library, http:\/\/www.cdc.informatik.tu-darmstadt.de\/TI\/LiDIA\/","key":"14_CR4"},{"unstructured":"Barreto, P.S.L.M.: Personal communication","key":"14_CR5"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P.S.L.M. Barreto","year":"2007","unstructured":"Barreto, P.S.L.M., Galbraith, S.D., H\u00e9igeartaigh, C.\u00d3., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Des. Codes Cryptography\u00a042(3), 239\u2013271 (2007)","journal-title":"Des. Codes Cryptography"},{"unstructured":"Barreto, P.S.L.M., Lindner, R., Misoczki, R.: Decoding square-free Goppa codes over $\\mathbb{F}_{p}$ . Cryptology ePrint Archive, Report 2010\/372 (2010), http:\/\/eprint.iacr.org\/","key":"14_CR7"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"P.S.L.M. Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-13797-6_13","volume-title":"Arithmetic of Finite Fields - WAIFI 2010","author":"N. Benger","year":"2009","unstructured":"Benger, N., Scott, M.: Constructing tower extensions for the implementation of Pairing-Based Cryptography. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol.\u00a06087, pp. 180\u2013195. Springer, Heidelberg (2009)"},{"unstructured":"Bernstein, D.J.: Optimizing linear maps modulo 2. In: Workshop: Software Performance Enhancement for Encryption and Decryption and Cryptographic Compilers, SPEED-CC 2009, pp. 3\u201318 (2009), http:\/\/www.hyperelliptic.org\/SPEED\/record09.pdf","key":"14_CR10"},{"doi-asserted-by":"crossref","unstructured":"Beuchat, J.-L., Gonz\u00e1lez D\u00edaz, J.E., Mitsunari, S., Okamoto, E., Rodr\u00edguez-Henr\u00edquez, F., Teruya, T.: High-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves. Cryptology ePrint Archive, Report 2010\/354 (2010), http:\/\/eprint.iacr.org\/ (to appear in Pairing 2010)","key":"14_CR11","DOI":"10.1007\/978-3-642-17455-1_2"},{"key":"14_CR12","series-title":"London Mathematical Society. Lecture Note Series","volume-title":"Advances in Elliptic Curve Cryptography","year":"2005","unstructured":"Blake, I., Seroussi, G., Smart, N.P. (eds.): Advances in Elliptic Curve Cryptography. London Mathematical Society. Lecture Note Series. Cambridge University Press, Cambridge (2005)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","first-page":"400","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"J. Bos","year":"1989","unstructured":"Bos, J., Coster, M.: Addition chain heuristics. In: Goos, G., Hartmanis, J. (eds.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 400\u2013407. Springer, Heidelberg (1989)"},{"doi-asserted-by":"crossref","unstructured":"Cohen, H., Frey, G.: Hanbook of Elliptic and Hyperelliptic Curve Cryptography. Chapman & Hall\/CRC (2006)","key":"14_CR15","DOI":"10.1201\/9781420034981"},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2007.906082","volume":"12","author":"N. Cruz-Cort\u00e9s","year":"2008","unstructured":"Cruz-Cort\u00e9s, N., Rodr\u00edguez-Henriquez, F., Coello Coello, C.: An Artificial Immune System heuristic for generating short addition chains. IEEE Transactions on Evolutionary Computation\u00a012(1), 1\u201324 (2008)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-73489-5_10","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"A.J. Devegili","year":"2007","unstructured":"Devegili, A.J., Scott, M., Dahab, R.: Implementing cryptographic pairings over Barreto-Naehrig curves. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 197\u2013207. Springer, Heidelberg (2007)"},{"unstructured":"Dominguez Perez, L.J.: Automatic code generator website, http:\/\/www.computing.dcu.ie\/~ldominguez\/phdproject.html","key":"14_CR18"},{"unstructured":"Dominguez Perez, L.J., Scott, M.: Automatic generation of optimised cryptographic pairing functions. In: SPEED-CC 2009 Workshop Memories (2009), http:\/\/www.hyperelliptic.org\/SPEED\/record09.pdf","key":"14_CR19"},{"issue":"3","key":"14_CR20","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0210047","volume":"10","author":"P. Downey","year":"1981","unstructured":"Downey, P., Leong, B., Sethi, R.: Computing sequences with addition chains. SIAM Journal on Computing\u00a010(3), 638\u2013646 (1981)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Freeman, D.: Constructing pairing-friendly elliptic curves with embedding degree 10. In: Sha, E., Han, S.-K., Xu, C.-Z., Kim, M.H., Yang, L.T., Xiao, B. (eds.) EUC 2006. LNCS, vol.\u00a04096, pp. 452\u2013465. Springer, Heidelberg (2006);","key":"#cr-split#-14_CR21.1","DOI":"10.1007\/11792086_32"},{"unstructured":"In: Algorithmic Number Theory Symposium ANTS-VII","key":"#cr-split#-14_CR21.2"},{"issue":"2","key":"14_CR22","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D. Freeman","year":"2010","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. Journal of Cryptology\u00a023(2), 224\u2013280 (2010)","journal-title":"Journal of Cryptology"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-85538-5_15","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"S.D. Galbraith","year":"2008","unstructured":"Galbraith, S.D., Scott, M.: Exponentiation in pairing-friendly groups using homomorphisms. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 211\u2013224. Springer, Heidelberg (2008)"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R.P. Gallant","year":"2001","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 190\u2013200. Springer, Heidelberg (2001)"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-540-72540-4_25","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"R. Granger","year":"2007","unstructured":"Granger, R., Hess, F., Oyono, R., Th\u00e9riault, N., Vercauteren, F.: Ate pairing on hyperelliptic curves. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 430\u2013447. Springer, Heidelberg (2007)"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/11792086_34","volume-title":"Algorithmic Number Theory","author":"R. Granger","year":"2006","unstructured":"Granger, R., Page, D., Smart, N.P.: High security Pairing-Based Cryptography revisited. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 480\u2013494. Springer, Heidelberg (2006)"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-85538-5_2","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"F. Hess","year":"2008","unstructured":"Hess, F.: Pairing lattices. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 18\u201338. Springer, Heidelberg (2008), http:\/\/www.math.tu-berlin.de\/~hess\/personal\/pairing-lattice.pdf"},{"issue":"10","key":"14_CR28","doi-asserted-by":"publisher","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F. Hess","year":"2006","unstructured":"Hess, F., Smart, N.P., Vercauteren, F.: The Eta pairing revisited. IEEE Trans. Information Theory\u00a052(10), 4595\u20134602 (2006)","journal-title":"IEEE Trans. Information Theory"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Algorithmic Number Theory","author":"A. Joux","year":"2000","unstructured":"Joux, A.: A one round protocol for tripartite Diffie\u2013Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 385\u2013394. Springer, Heidelberg (2000)"},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-85538-5_9","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"E. Kachisa","year":"2008","unstructured":"Kachisa, E., Schaeffer, E.F., Scott, M.: Constructing Brezing-Weng pairing friendly elliptic curves using elements in the cyclotomic field. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 126\u2013135. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Lauter, K., Montgomery, P.L., Naehrig, M.: An analysis of affine coordinates for pairing computation. Cryptology ePrint Archive, Report 2010\/363 (2010), http:\/\/eprint.iacr.org\/ (to appear in Pairing 2010)","key":"14_CR31","DOI":"10.1007\/978-3-642-17455-1_1"},{"unstructured":"Lee, H.-S., Lee, E., Park, C.-M.: Efficient and generalized pairing computation on Abelian varieties. Cryptology ePrint Archive, Report 2008\/040 (2008), http:\/\/eprint.iacr.org\/","key":"14_CR32"},{"unstructured":"Lynn, B.: PBC library - the Pairing-Based Cryptography library, http:\/\/crypto.stanford.edu\/pbc\/","key":"14_CR33"},{"unstructured":"Matsuda, S., Kanayama, N., Hess, F., Okamoto, E.: Optimised versions of the ate and twisted ate pairings. Cryptology ePrint Archive, Report 2007\/013 (2007), http:\/\/eprint.iacr.org\/","key":"14_CR34"},{"unstructured":"Miller, V.S.: Short programs for functions on curves (1986), http:\/\/crypto.stanford.edu\/Miller\/Miller.ps","key":"14_CR35"},{"issue":"4","key":"14_CR36","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V.S. Miller","year":"2004","unstructured":"Miller, V.S.: The Weil pairing, and its efficient calculation. J. Cryptol.\u00a017(4), 235\u2013261 (2004)","journal-title":"J. Cryptol."},{"key":"14_CR37","first-page":"1234","volume":"E84","author":"A. Miyaji","year":"2001","unstructured":"Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundamentals\u00a0E84, 1234\u20131243 (2001)","journal-title":"IEICE Trans. Fundamentals"},{"issue":"4","key":"14_CR38","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0747-7171(02)00139-6","volume":"35","author":"T. Mulders","year":"2003","unstructured":"Mulders, T., Storjohann, A.: On lattice reduction for polynomial matrices. J. Symb. Comput.\u00a035(4), 377\u2013401 (2003)","journal-title":"J. Symb. Comput."},{"key":"14_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-14712-8_7","volume-title":"Progress in Cryptology - LATINCRYPT 2010","author":"M. Naehrig","year":"2010","unstructured":"Naehrig, M., Niederhagen, R., Schwabe, P.: New software speed records for cryptographic pairings. In: Abdalla, M. (ed.) LATINCRYPT 2010. LNCS, vol.\u00a06212, pp. 109\u2013123. Springer, Heidelberg (2010)"},{"key":"14_CR40","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. Journal of Algorithms\u00a02, 13\u201321 (1981)","journal-title":"Journal of Algorithms"},{"unstructured":"Scott, M.: MIRACL \u2013 Multiprecision Integer and Rational Arithmetic C\/C++ Library, http:\/\/ftp.computing.dcu.ie\/pub\/crypto\/miracl.zip","key":"14_CR41"},{"key":"14_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-03298-1_8","volume-title":"Pairing 2009","author":"M. Scott","year":"2009","unstructured":"Scott, M., Benger, N., Charlemagne, M., Dominguez Perez, L.J., Kachisa, E.J.: Fast hashing to G 2 on pairing-friendly curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 102\u2013113. Springer, Heidelberg (2009)"},{"key":"14_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-03298-1_6","volume-title":"Pairing 2009","author":"M. Scott","year":"2009","unstructured":"Scott, M., Benger, N., Charlemagne, M., Dominguez Perez, L.J., Kachisa, E.J.: On the final exponentiation for calculating pairings on ordinary elliptic curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 78\u201388. Springer, Heidelberg (2009)"},{"key":"14_CR44","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The Arithmetic of Elliptic Curves","author":"J.H. Silverman","year":"1986","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves. Springer, Heidelberg (1986)"},{"issue":"1","key":"14_CR45","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F. Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Transactions on Information Theory\u00a056(1), 455\u2013461 (2010), http:\/\/www.cosic.esat.kuleuven.be\/publications\/article-1039.pdf","journal-title":"IEEE Transactions on Information Theory"},{"unstructured":"Zhao, C.-A., Zhang, F., Huang, J.: A note on the ate pairing. Cryptology ePrint Archive, Report 2007\/247 (2007), http:\/\/eprint.iacr.org\/","key":"14_CR46"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography - Pairing 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17455-1_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:53:31Z","timestamp":1606186411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17455-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174544","9783642174551"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17455-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}