{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T03:12:15Z","timestamp":1648782735390},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811050640","type":"print"},{"value":"9789811050657","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,7,26]],"date-time":"2017-07-26T00:00:00Z","timestamp":1501027200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-10-5065-7_5","type":"book-chapter","created":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T13:58:39Z","timestamp":1500991119000},"page":"81-96","source":"Crossref","is-referenced-by-count":0,"title":["Pairings on Hyperelliptic Curves with Considering Recent Progress on the NFS Algorithms"],"prefix":"10.1007","author":[{"given":"Masahiro","family":"Ishii","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,26]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-3-642-36334-4_11","volume-title":"Pairing-Based Cryptography - Pairing 2012","author":"DF Aranha","year":"2013","unstructured":"D.F. Aranha, L. Fuentes-Casta\u00f1eda, E. Knapp, A. Menezes, F. Rodr\u00edguez-Henr\u00edquez, Implementing pairings at the 192-bit security level, in Pairing-Based Cryptography - Pairing 2012, vol. 7708, Lecture Notes in Computer Science, ed. by M. Abdalla, T. Lange (Springer, Berlin, 2013), pp. 177\u2013195"},{"key":"5_CR2","unstructured":"J. Balakrishnan, J. Belding, S. Chisholm, K. Eisentr\u00e4ger, K.E. Stange, E. Teske, Pairings on hyperelliptic curves, in CoRR, http:\/\/arxiv.org\/abs\/0908.3731v2 (2009)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-662-46800-5_6","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"R Barbulescu","year":"2015","unstructured":"R. Barbulescu, P. Gaudry, A. Guillevic, F. Morain, Improving NFS for the discrete logarithm problem in non-prime finite fields, in Advances in Cryptology - EUROCRYPT 2015, vol. 9056, Lecture Notes in Computer Science, ed. by E. Oswald, M. Fischlin (Springer, Berlin, 2015), pp. 129\u2013155"},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-662-46800-5_6","volume-title":"Advances in Cryptology - EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26\u201330, 2015, Proceedings, Part I","author":"R Barbulescu","year":"2015","unstructured":"R. Barbulescu, P. Gaudry, A. Guillevic, F. Morain, Improving NFS for the discrete logarithm problem in non-prime finite fields, in Advances in Cryptology - EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26\u201330, 2015, Proceedings, Part I, ed. by E. Oswald, M. Fischlin (Springer, Berlin, 2015), pp. 129\u2013155"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - EUROCRYPT 2014","author":"R Barbulescu","year":"2014","unstructured":"R. Barbulescu, P. Gaudry, A. Joux, E. Thom, A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic, in Advances in Cryptology - EUROCRYPT 2014, vol. 8441, Lecture Notes in Computer Science, ed. by P. Nguyen, E. Oswald (Springer, Berlin, 2014), pp. 1\u201316"},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-3-662-48800-3_2","volume-title":"Advances in Cryptology - ASIACRYPT 2015: 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29 - December 3, 2015, Proceedings, Part II","author":"R Barbulescu","year":"2015","unstructured":"R. Barbulescu, P. Gaudry, T. Kleinjung, The tower number field sieve, in Advances in Cryptology - ASIACRYPT 2015: 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29 - December 3, 2015, Proceedings, Part II, ed. by T. Iwata, H.J. Cheon (Springer, Berlin, 2015), pp. 31\u201355"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"N. Benger, M. Scott, Constructing tower extensions of finite fields for implementation of pairing-based cryptography, in Arithmetic of Finite Fields: Third International Workshop, ed. by M.A. Hasan, T.\u00a0Helleseth, WAIFI 2010, Istanbul, Turkey, June 27\u201330, 2010. Proceedings (Springer, Berlin, 2010), pp. 180\u2013195","DOI":"10.1007\/978-3-642-13797-6_13"},{"key":"5_CR8","unstructured":"BlueKrypt: - cryptographic key length recommendation, http:\/\/www.keylength.com (2012)"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"X. Fan, G. Gong, D. Jao, Speeding up pairing computations on genus 2 hyperelliptic curves with efficiently computable automorphisms, in Pairing-Based Cryptography \u2013 Pairing 2008, ed. by S.\u00a0Galbraith, K.\u00a0Paterson. Lecture Notes in Computer Science, vol. 5209 (Springer, Berlin, 2008), pp. 243\u2013264. doi: 10.1007\/978-3-540-85538-5_17","DOI":"10.1007\/978-3-540-85538-5_17"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/978-3-642-04159-4_2","volume-title":"Selected Areas in Cryptography","author":"X Fan","year":"2009","unstructured":"X. Fan, G. Gong, D. Jao, Efficient pairing computation on genus 2 curves in projective coordinates, in Selected Areas in Cryptography, vol. 5381, Lecture Notes in Computer Science, ed. by R. Avanzi, L. Keliher, F. Sica (Springer, Berlin, 2009), pp. 18\u201334"},{"issue":"2","key":"5_CR11","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D Freeman","year":"2010","unstructured":"D. Freeman, M. Scott, E. Teske, A taxonomy of pairing-friendly elliptic curves. J. Cryptol. 23(2), 224\u2013280 (2010)","journal-title":"J. Cryptol."},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1007\/978-3-642-28496-0_25","volume-title":"Selected Areas in Cryptography: 18th International Workshop, SAC 2011, Toronto, ON, Canada, August 11\u201312, 2011, Revised Selected Papers","author":"L Fuentes-Casta\u00f1eda","year":"2012","unstructured":"L. Fuentes-Casta\u00f1eda, E. Knapp, F. Rodr\u00edguez-Henr\u00edquez, Faster hashing to $$\\mathbb{G}_2$$ , in Selected Areas in Cryptography: 18th International Workshop, SAC 2011, Toronto, ON, Canada, August 11\u201312, 2011, Revised Selected Papers, ed. by A. Miri, S. Vaudenay (Springer, Berlin, 2012), pp. 412\u2013430"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"S.D. Galbraith, X. Lin, D.J.M. Morales, Pairings on hyperelliptic curves with a real model, in Pairing-Based Cryptography \u2013 Pairing 2008, ed. by S.\u00a0Galbraith, K.\u00a0Paterson. Lecture Notes in Computer Science, vol. 5209 (Springer, Berlin, 2008), pp. 265\u2013281","DOI":"10.1007\/978-3-540-85538-5_18"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"S.D. Galbraith, K.G. Paterson, N.P. Smart, Pairings for cryptographers. Discret. Appl. Math. 156(16), 3113\u20133121 (2008). doi: 10.1016\/j.dam.2007.12.010","DOI":"10.1016\/j.dam.2007.12.010"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"R. Granger, D. Page, N.P. Smart, High security pairing-based cryptography revisited, in Algorithmic Number Theory: 7th International Symposium, ANTS-VII, Berlin, Germany, July 23\u201328, 2006. Proceedings, ed. by F.\u00a0Hess, S.\u00a0Pauli, M.\u00a0Pohst (Springer, Berlin, 2006), pp. 480\u2013494","DOI":"10.1007\/11792086_34"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"R. Granger, M. Scott, Faster squaring in the cyclotomic subgroup of sixth degree extensions, in Public Key Cryptography \u2013 PKC 2010: 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26\u201328, 2010. Proceedings, ed. by P.Q. Nguyen, D.\u00a0Pointcheval (Springer, Berlin, 2010), pp. 209\u2013223","DOI":"10.1007\/978-3-642-13013-7_13"},{"key":"5_CR17","unstructured":"M. Ishii, Pairings on hyperelliptic curves of genus 2 at high security levels. Ph.D. thesis, Nara Institute of Science and Technology (2016), http:\/\/library.naist.jp\/dspace\/handle\/10061\/11005"},{"key":"5_CR18","unstructured":"J. Jeong, T. Kim, Extended tower number field sieve with application to finite fields of arbitrary composite extension degree. Cryptol. ePrint Arch. Rep. 2016\/526 (2016), http:\/\/eprint.iacr.org\/2016\/526"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"A. Joux, C. Pierrot, The special number field sieve in $$\\mathbb{F}_{p^n}$$ , application to pairing-friendly constructions, in Pairing-Based Cryptography \u2013 Pairing 2013: 6th International Conference, Beijing, China, November 22\u201324, 2013, Revised Selected Papers, ed. by Z.\u00a0Cao, F.\u00a0Zhang (Springer International Publishing, Berlin, 2014), pp. 45\u201361","DOI":"10.1007\/978-3-319-04873-4_3"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"K. Karabina, Squaring in cyclotomic subgroups. Math. Comput. 82(281) (2013), http:\/\/dx.doi.org\/10.1090\/S0025-5718-2012-02625-1","DOI":"10.1090\/S0025-5718-2012-02625-1"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/978-3-540-85538-5_12","volume-title":"Pairing-Based Cryptography - Pairing 2008","author":"M Kawazoe","year":"2008","unstructured":"M. Kawazoe, T. Takahashi, Pairing-friendly hyperelliptic curves with ordinary jacobians of type $$y^2=x^5+ax$$ , in Pairing-Based Cryptography - Pairing 2008, vol. 5209, Lecture Notes in Computer Science, ed. by S. Galbraith, K. Paterson (Springer, Berlin, 2008), pp. 164\u2013177"},{"key":"5_CR22","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/978-3-662-53018-4_20","volume-title":"Advances in Cryptology - CRYPTO 2016: 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14\u201318, 2016, Proceedings, Part I","author":"T Kim","year":"2016","unstructured":"T. Kim, R. Barbulescu, Extended tower number field sieve: A new complexity for the medium prime case, in Advances in Cryptology - CRYPTO 2016: 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14\u201318, 2016, Proceedings, Part I, ed. by M. Robshaw, J. Katz (Springer, Berlin, 2016), pp. 543\u2013571"},{"key":"5_CR23","unstructured":"N. Koblitz, A. Menezes, Pairing-based cryptography at high security levels, in Cryptography and Coding: 10th IMA International Conference, Cirencester, UK, December 19\u201321, 2005. Proceedings, ed. by N.P. Smart (Springer, Berlin, 2005), pp. 13\u201336"},{"key":"5_CR24","unstructured":"A. Menezes, P. Sarkar, S. Singh, Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography. Cryptol. ePrint Arch. Rep. 2016\/1102 (2016), http:\/\/eprint.iacr.org\/2016\/1102"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"C. \u00d3\u00a0h\u00c9igeartaigh, M. Scott, Pairing calculation on supersingular genus 2 curves, in Selected Areas in Cryptography: 13th International Workshop, SAC 2006, ed. by E.\u00a0Biham, A.M. Youssef. Lecture Notes in Computer Science, vol. 4356 (Springer, Berlin, 2007), pp. 302\u2013316","DOI":"10.1007\/978-3-540-74462-7_21"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/978-3-642-03298-1_6","volume-title":"Pairing-Based Cryptography - Pairing 2009","author":"M Scott","year":"2009","unstructured":"M. Scott, N. Benger, M. Charlemagne, L. Dominguez Perez, E. Kachisa, On the final exponentiation for calculating pairings on ordinary elliptic curves, in Pairing-Based Cryptography - Pairing 2009, vol. 5671, Lecture Notes in Computer Science, ed. by H. Shacham, B. Waters (Springer, Berlin, 2009), pp. 78\u201388"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"M. Stam, A.K. Lenstra, Efficient subgroup exponentiation in quadratic and sixth degree extensions, in Cryptographic Hardware and Embedded Systems - CHES 2002: 4th International Workshop Redwood Shores, CA, USA, August 13\u201315, 2002 Revised Papers, ed. by B.S. Kaliski, \u00e7.K. Ko\u00e7, C.\u00a0Paar (Springer, Berlin, 2003), pp. 318\u2013332","DOI":"10.1007\/3-540-36400-5_24"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"T. Teruya, K. Saito, N. Kanayama, Y. Kawahara, T. Kobayashi, E. Okamoto, Constructing symmetric pairings over supersingular elliptic curves with embedding degree three, in Pairing-Based Cryptography \u2013 Pairing 2013, ed. by Z.\u00a0Cao, F.\u00a0Zhang. Lecture Notes in Computer Science, vol. 8365 (Springer, Berlin, 2014), pp. 97\u2013112","DOI":"10.1007\/978-3-319-04873-4_6"},{"issue":"8","key":"5_CR29","doi-asserted-by":"crossref","first-page":"1528","DOI":"10.1007\/s11432-010-4024-7","volume":"53","author":"F Zhang","year":"2010","unstructured":"F. Zhang, Twisted ate pairing on hyperelliptic curves and applications. Sci. China Inf. Sci. 53(8), 1528\u20131538 (2010)","journal-title":"Sci. China Inf. Sci."},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"X. Zhang, K. Wang, Fast symmetric pairing revisited, in Pairing-Based Cryptography \u2013 Pairing 2013, ed. by Z.\u00a0Cao, F.\u00a0Zhang. Lecture Notes in Computer Science, vol. 8365 (Springer, Berlin, 2014), pp. 131\u2013148","DOI":"10.1007\/978-3-319-04873-4_8"}],"container-title":["Mathematical Modelling for Next-Generation Cryptography","Mathematics for Industry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-5065-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T15:33:09Z","timestamp":1569943989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-5065-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,26]]},"ISBN":["9789811050640","9789811050657"],"references-count":30,"URL":"http:\/\/dx.doi.org\/10.1007\/978-981-10-5065-7_5","relation":{},"ISSN":["2198-350X","2198-3518"],"issn-type":[{"value":"2198-350X","type":"print"},{"value":"2198-3518","type":"electronic"}],"published":{"date-parts":[[2017,7,26]]}}}