{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,7]],"date-time":"2022-05-07T04:25:21Z","timestamp":1651897521924},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2021,1,1]]},"DOI":"10.1587\/transfun.2020eal2046","type":"journal-article","created":{"date-parts":[[2020,7,16]],"date-time":"2020-07-16T22:06:15Z","timestamp":1594937175000},"page":"315-318","source":"Crossref","is-referenced-by-count":1,"title":["Improvement of Final Exponentiation for Pairings on BLS Curves with Embedding Degree 15"],"prefix":"10.1587","volume":"E104.A","author":[{"given":"Yuki","family":"NANJO","sequence":"first","affiliation":[{"name":"Okayama University"}]},{"given":"Masaaki","family":"SHIRASE","sequence":"additional","affiliation":[{"name":"Future University Hakodate"}]},{"given":"Takuya","family":"KUSAKA","sequence":"additional","affiliation":[{"name":"Okayama University"}]},{"given":"Yasuyuki","family":"NOGAMI","sequence":"additional","affiliation":[{"name":"Okayama University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] D. Boneh, B. Lynn, and H. Shacham, \u201cShort signatures from the weil pairing,\u201d J. Cryptol., vol.17, no.4, pp.297-319, 2004. 10.1007\/s00145-004-0314-9","DOI":"10.1007\/s00145-004-0314-9"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] D. Boneh and X. Boyen, \u201cShort signatures without random oracles,\u201d International Conference on the Theory and Applications of Cryptographic Techniques, pp.56-73, Springer, 2004. 10.1007\/978-3-540-24676-3_4","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, \u201cPublic key encryption with keyword search,\u201d International conference on the theory and applications of cryptographic techniques, pp.506-522, Springer, 2004. 10.1007\/978-3-540-24676-3_30","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] V. Goyal, O. Pandey, A. Sahai, and B. Waters, \u201cAttribute-based encryption for fine-grained access control of encrypted data,\u201d Proc. 13th ACM conference on Computer and communications security, pp.89-98, ACM, 2006. 10.1145\/1180405.1180418","DOI":"10.1145\/1180405.1180418"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] T. Okamoto and K. Takashima, \u201cHomomorphic encryption and signatures from vector decomposition,\u201d International Conference on Pairing-Based Cryptography, pp.57-74, Springer, 2008. 10.1007\/978-3-540-85538-5_4","DOI":"10.1007\/978-3-540-85538-5_4"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] P.S. Barreto, B. Lynn, and M. Scott, \u201cConstructing elliptic curves with prescribed embedding degrees,\u201d International Conference on Security in Communication Networks, pp.257-267, Springer, 2002. 10.1007\/3-540-36413-7_19","DOI":"10.1007\/3-540-36413-7_19"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] P.S. Barreto and M. Naehrig, \u201cPairing-friendly elliptic curves of prime order,\u201d International Workshop on Selected Areas in Cryptography, pp.319-331, Springer, 2005. 10.1007\/11693383_22","DOI":"10.1007\/11693383_22"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[9] E. Fouotsa, N.E. Mrabet, and A. Pecha, \u201cOptimal ate pairing on elliptic curves with embedding degree 9,15 and 27,\u201d J. Groups, Complexity, Cryptology, vol.12, no.1, 2020. https:\/\/arxiv.org\/abs\/2002.11920","DOI":"10.46298\/jgcc.2020.12.1.6167"},{"key":"9","unstructured":"[10] R. Barbulescu, N. El Mrabet, and L. Ghammam, \u201cA taxonomy of pairings, their security, their complexity,\u201d 2019. https:\/\/eprint.iacr.org\/2019\/485.pdf"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[11] M. Scott, N. Benger, M. Charlemagne, L.J.D. Perez, and E.J. Kachisa, \u201cOn the final exponentiation for calculating pairings on ordinary elliptic curves,\u201d International Conference on Pairing-Based Cryptography, pp.78-88, Springer, 2009. 10.1007\/978-3-642-03298-1_6","DOI":"10.1007\/978-3-642-03298-1_6"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[12] L. Fuentes-Castaneda, E. Knapp, and F. Rodr\u00edguez-Henr\u00edquez, \u201cFaster hashing to \ud835\udd3e<sub>2<\/sub>,\u201d International Workshop on Selected Areas in Cryptography, pp.412-430, Springer, 2011. 10.1007\/978-3-642-28496-0_25","DOI":"10.1007\/978-3-642-28496-0_25"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[13] X. Zhang and D. Lin, \u201cAnalysis of optimum pairing products at high security levels,\u201d International Conference on Cryptology in India, pp.412-430, Springer, 2012. 10.1007\/978-3-642-34931-7_24","DOI":"10.1007\/978-3-642-34931-7_24"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[14] N. Koblitz and A. Menezes, \u201cPairing-based cryptography at high security levels,\u201d IMA International Conference on Cryptography and Coding, pp.13-36, Springer, 2005. 10.1007\/11586821_2","DOI":"10.1007\/11586821_2"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[15] H.W. Lenstra, A.K. Lenstra, L. Lovfiasz, et al., \u201cFactoring polynomials with rational coeficients,\u201d 1982.","DOI":"10.1007\/BF01457454"},{"key":"15","unstructured":"[16] P. Duan, S. Cui, and C.W. Chan, \u201cSpecial polynomial families for generating more suitable elliptic curves for pairing-based cryptosystems,\u201d IACR Cryptology ePrint Archive, vol.2005, p.342, 2005."}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/1\/E104.A_2020EAL2046\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,25]],"date-time":"2021-03-25T12:56:54Z","timestamp":1616677014000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/1\/E104.A_2020EAL2046\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2020eal2046","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,1]]}}}