{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T05:16:48Z","timestamp":1721020608900},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,6,8]],"date-time":"2013-06-08T00:00:00Z","timestamp":1370649600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s11432-013-4840-7","type":"journal-article","created":{"date-parts":[[2013,6,8]],"date-time":"2013-06-08T03:55:58Z","timestamp":1370663758000},"page":"1-10","source":"Crossref","is-referenced-by-count":4,"title":["Implementing optimized pairings with elliptic nets"],"prefix":"10.1007","volume":"57","author":[{"given":"ChunMing","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DongMei","family":"Ni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MaoZhi","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BaoAn","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YanFeng","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,6,8]]},"reference":[{"key":"4840_CR1","first-page":"213","volume-title":"Proceedings of CRYPTO2001, Vol. 2139 of Lecture Notes in Computer Science","author":"D Boneh","year":"2001","unstructured":"Boneh D, Franklin M. Identity-based encryption from the Weil pairing. In: Kilian J, ed. Proceedings of CRYPTO2001, Vol. 2139 of Lecture Notes in Computer Science. Berlin: Springer-Verlag, 2001. 213\u2013229"},{"key":"4840_CR2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Proceedings of Algorithmic Number Theory Symposium on Algorithmic Number Theory","author":"A Joux","year":"2000","unstructured":"Joux A. A one round protocol for tripartite Diffie-Hellman. In: Proceedings of Algorithmic Number Theory Symposium on Algorithmic Number Theory. London: Springer-Verlag, 2000. 385\u2013394"},{"key":"4840_CR3","first-page":"514","volume-title":"Proceedings of ASIACRYPT 2001, Vol. 2248 of Lecture Notes in Computer Science","author":"D Boneh","year":"2001","unstructured":"Boneh D, Lynn B, Shacham H. Short signatures from the Weil pairing. In: Boyd C, ed. Proceedings of ASIACRYPT 2001, Vol. 2248 of Lecture Notes in Computer Science. Berlin: Springer-Verlag, 2001. 514\u2013532"},{"key":"4840_CR4","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Proceedings of Eurocrypt 2004","author":"D Boneh","year":"2004","unstructured":"Boneh D, Crescenzo G D, Ostrovsky R, et al. Public-key encryption with keyword search. In: Proceedings of Eurocrypt 2004. Berlin: Springer-Verlag, 2004. 506\u2013522"},{"key":"4840_CR5","first-page":"237","volume-title":"Lecture Notes in Computer Science","author":"A C Yao","year":"2012","unstructured":"Yao A C, Zhao Y. Computationally-Fair Group and Identity-Based Key-Exchange. In: Agrawal M, Cooper S B, Li A, eds. Vol. 7287 of Lecture Notes in Computer Science. Berlin\/Heidelberg: Springer-Verlag, 2012. 237\u2013247"},{"key":"4840_CR6","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1007\/s11276-010-0318-3","volume":"17","author":"T Eissa","year":"2011","unstructured":"Eissa T, Razak S A, Ngadi M D A. Towards providing a new lightweight authentication and encryption scheme for MANET. Wirel Netw, 2011, 17: 833\u2013842","journal-title":"Wirel Netw"},{"key":"4840_CR7","first-page":"289","volume-title":"INTRUST 2011, LNCS 7222","author":"P Q Cheng","year":"2012","unstructured":"Cheng P Q, Gu Y, Lv Z H, et al. A performance analysis of identity-based encryption schemes. In: Chen L, Yung M, Zhu L, eds. INTRUST 2011, LNCS 7222. Berlin\/Heidelberg: Springer-Verlag, 2012. 289\u2013303"},{"key":"4840_CR8","first-page":"490","volume-title":"ICISC 2011, LNCS 7259","author":"A Fujioka","year":"2012","unstructured":"Fujioka A, Suzuki K. Sufficient condition for identity-based authenticated key exchange resilient to leakage of secret keys. In: Kim H, ed. ICISC 2011, LNCS 7259. Berlin\/Heidelberg: Springer-Verlag, 2012. 490\u2013509"},{"key":"4840_CR9","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Proceedings of Advances in Cryptology-CRYPTO 2002","author":"P S L M Barreto","year":"2002","unstructured":"Barreto P S L M, Kim H Y, Lynn B, et al. Efficient algorithms for pairing-based cryptosystems. In: Proceedings of Advances in Cryptology-CRYPTO 2002, LNCS 2442. Berlin\/Heidelberg: Springer-Verlag, 2002. 354\u2013369"},{"key":"4840_CR10","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/978-3-642-20465-4_5","volume-title":"Advances in Cryptology-EUROCRYPT 2011","author":"D F Aranha","year":"2011","unstructured":"Aranha D F, Karabina K, Longa P, et al. Faster explicit formulas for computing pairings over ordinary curves. In: Advances in Cryptology-EUROCRYPT 2011, LNCS 6632. Berlin\/Heidelberg: Springer-Verlag, 2011. 48\u201368"},{"key":"4840_CR11","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/978-3-642-23951-9_28","volume-title":"Cryptographic Hardware and Embedded Systems-CHES 2011","author":"R C C Cheung","year":"2011","unstructured":"Cheung R C C, Duquesne S, Fan J F, et al. FPGA implementation of pairings using residue number system and lazy reduction. In: Cryptographic Hardware and Embedded Systems-CHES 2011, LNCS 6917. Berlin\/Heidelberg: Springer-Verlag, 2011. 421\u2013441"},{"key":"4840_CR12","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-540-73489-5_19","volume-title":"Pairing-Based Cryptography-PAIRING 2007","author":"K E Stange","year":"2007","unstructured":"Stange K E. The Tate pairing via elliptic nets. In: Pairing-Based Cryptography-PAIRING 2007, LNCS 4575. Berlin: Springer, 2007. 329\u2013348"},{"key":"4840_CR13","first-page":"163","volume-title":"American Mathematical Society","author":"G Everest","year":"2003","unstructured":"Everest G, van der Poorten A, Shparlinski I, et al. Recurrence Sequences. Vol. 104 of Mathematical Surveys and Monographs. American Mathematical Society, 2003. 163\u2013175"},{"key":"4840_CR14","volume-title":"Elliptic divibility sequences. Dissertation for the Doctoral Degree","author":"R Shipsey","year":"2001","unstructured":"Shipsey R. Elliptic divibility sequences. Dissertation for the Doctoral Degree. University of London, 2001"},{"key":"4840_CR15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.2307\/2371930","volume":"70","author":"M Ward","year":"1948","unstructured":"Ward M. Memoir on elliptic divisibility sequences. Amer J Math, 1948, 70: 31\u201374","journal-title":"Amer J Math"},{"key":"4840_CR16","volume-title":"Elliptic nets and elliptic curves. Dissertation for the Doctoral Degree","author":"K E Stange","year":"2008","unstructured":"Stange K E. Elliptic nets and elliptic curves. Dissertation for the Doctoral Degree. Brown University, 2008"},{"key":"4840_CR17","series-title":"LNCS","first-page":"211","volume-title":"Pairing 2008","author":"F Hess","year":"2008","unstructured":"Hess F. Pairing lattices. Galbraith S D, Paterson K G, eds. Pairing 2008, LNCS 5209. Berlin: Springer-Verlag, 2008. 211\u2013224"},{"key":"4840_CR18","doi-asserted-by":"crossref","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F Hess","year":"2006","unstructured":"Hess F, Smart N, Vercauteren F. The Eta-pairing revisited. IEEE Trans Inform Theory, 2006, 52: 4595\u20134602","journal-title":"IEEE Trans Inform Theory"},{"key":"4840_CR19","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/978-3-540-77272-9_18","volume-title":"the 11th IMA International Conference on Cryptography and Coding","author":"S Matsuda","year":"2007","unstructured":"Matsuda S, Kanayama N, Hess F, et al. Optimised versions of the Ate and twisted Ate pairings. In: the 11th IMA International Conference on Cryptography and Coding, LNCS 4887. Berlin: Springer-Verlag, 2007. 302\u2013312"},{"key":"4840_CR20","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10623-011-9605-y","volume":"67","author":"H Hong","year":"2013","unstructured":"Hong H, Lee E, Lee H S, et al. Simple and exact formula for minimum loop length in Atei pairing based on Brezing-Weng curves. Designs Codes Cryptogr, 2013, 67: 271\u2013292","journal-title":"Designs Codes Cryptogr"},{"key":"4840_CR21","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography-SAC 2005","author":"P S L M Barreto","year":"2006","unstructured":"Barreto P S L M, Naehrig M. Pairing-friendly elliptic curves of prime order. In: Selected Areas in Cryptography-SAC 2005, LNCS 3897. Berlin: Springer, 2006. 319\u2013331"},{"key":"4840_CR22","doi-asserted-by":"crossref","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. J Cryptol, 2010, 23: 224\u2013280","journal-title":"J Cryptol"},{"key":"4840_CR23","first-page":"115","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"S Duquesne","year":"2006","unstructured":"Duquesne S, Frey G. Background on pairings. In: Handbook of Elliptic and Hyperelliptic Curve Cryptography. Boca Raton: Chapman & Hall\/CRC, 2006. 115\u2013124"},{"key":"4840_CR24","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/978-3-540-85538-5_13","volume-title":"Pairing 2008","author":"Y Nogami","year":"2008","unstructured":"Nogami Y, Akane M, Sakemi Y, et al. Integer variable \u03c7-based Ate pairing. In: Galbraith S D, Paterson K G, eds. Pairing 2008, LNCS 5209. Heidelberg: Springer, 2008. 178\u2013191"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-013-4840-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-013-4840-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-013-4840-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:37:51Z","timestamp":1559389071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-013-4840-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,8]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["4840"],"URL":"https:\/\/doi.org\/10.1007\/s11432-013-4840-7","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,8]]}}}