{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:39:37Z","timestamp":1767141577738,"version":"build-2238731810"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,7,17]],"date-time":"2017-07-17T00:00:00Z","timestamp":1500249600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s11227-017-2097-4","type":"journal-article","created":{"date-parts":[[2017,7,17]],"date-time":"2017-07-17T17:22:37Z","timestamp":1500312157000},"page":"1394-1417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An efficient implementation of pairing-based cryptography on MSP430 processor"],"prefix":"10.1007","volume":"74","author":[{"given":"Jihoon","family":"Kwon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seog Chung","family":"Seo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seokhie","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,17]]},"reference":[{"key":"2097_CR1","unstructured":"Adj G, Menezes A, Oliveira T, Rodr\u00edguez-Henr\u00edquez F (2013) Weakness of \n                        $${\\mathbb{F}}_{3^{6 \\cdot 509}}$$\n                        \n                            \n                                \n                                    F\n                                    \n                                        3\n                                        \n                                            6\n                                            \u00b7\n                                            509\n                                        \n                                    \n                                \n                            \n                        \n                     for discrete logarithm cryptography. In: International Conference on Pairing-Based Cryptography. Springer, New York, pp 20\u201344"},{"key":"2097_CR2","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.ffa.2014.10.009","volume":"32","author":"G Adj","year":"2015","unstructured":"Adj G, Menezes A, Oliveira T, Rodriguez-Henriquez F (2015) Weakness of \n                        $${\\mathbb{F}}_{3^{6 \\cdot 1429}}$$\n                        \n                            \n                                \n                                    F\n                                    \n                                        3\n                                        \n                                            6\n                                            \u00b7\n                                            1429\n                                        \n                                    \n                                \n                            \n                        \n                     and \n                        $${\\mathbb{F}}_{2^{4 \\cdot 3041}}$$\n                        \n                            \n                                \n                                    F\n                                    \n                                        2\n                                        \n                                            4\n                                            \u00b7\n                                            3041\n                                        \n                                    \n                                \n                            \n                        \n                     for discrete logarithm cryptography. Finite Fields Appl 32:148\u2013170","journal-title":"Finite Fields Appl"},{"key":"2097_CR3","doi-asserted-by":"crossref","unstructured":"Barbulescu R, Gaudry P, Joux A, Thom\u00e9 E (2014) A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, New York, pp 1\u201316","DOI":"10.1007\/978-3-642-55220-5_1"},{"issue":"3","key":"2097_CR4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"PS Barreto","year":"2007","unstructured":"Barreto PS, Galbraith SD, h\u00c9igeartaigh C\u00d3, Scott M (2007) Efficient pairing computation on supersingular abelian varieties. Des Codes Cryptogr 42(3):239\u2013271","journal-title":"Des Codes Cryptogr"},{"key":"2097_CR5","doi-asserted-by":"crossref","unstructured":"Barreto PS, Kim HY, Lynn B, Scott M (2002) Efficient algorithms for pairing-based cryptosystems. In: Annual International Cryptology Conference. Springer, New York, pp 354\u2013369","DOI":"10.1007\/3-540-45708-9_23"},{"key":"2097_CR6","doi-asserted-by":"crossref","unstructured":"Beuchat JL, Brisebarre N, Detrey J, Okamoto E, Rodr\u00edguez-Henr\u00edquez F (2008) A comparison between hardware accelerators for the modified tate pairing over \n                        $${\\mathbb{F}}_{2^m}$$\n                        \n                            \n                                \n                                    F\n                                    \n                                        2\n                                        m\n                                    \n                                \n                            \n                        \n                     and \n                        $${\\mathbb{F}}_{3^m}$$\n                        \n                            \n                                \n                                    F\n                                    \n                                        3\n                                        m\n                                    \n                                \n                            \n                        \n                    . In: International Conference on Pairing-Based Cryptography. Springer, New York, pp 297\u2013315","DOI":"10.1007\/978-3-540-85538-5_20"},{"key":"2097_CR7","doi-asserted-by":"crossref","unstructured":"Boneh D, Boyen X, Shacham H (2004) Short group signatures. In: Annual International Cryptology Conference. Springer, New York, pp 41\u201355","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"2097_CR8","doi-asserted-by":"crossref","unstructured":"Boneh D, Franklin M (2001) Identity-based encryption from the Weil pairing. In: Annual International Cryptology Conference. Springer, New York, pp 213\u2013229","DOI":"10.1007\/3-540-44647-8_13"},{"key":"2097_CR9","unstructured":"Duursma I, Lee HS (2003) Tate pairing implementation for hyperelliptic curves \n                        $$y^2= x^p-x+d$$\n                        \n                            \n                                \n                                    \n                                        y\n                                        2\n                                    \n                                    =\n                                    \n                                        x\n                                        p\n                                    \n                                    -\n                                    x\n                                    +\n                                    d\n                                \n                            \n                        \n                    . In: International Conference on the Theory and Application of Cryptology and Information Security. Springer, New York, pp 111\u2013123"},{"key":"2097_CR10","doi-asserted-by":"crossref","unstructured":"Eschenauer L, Gligor VD (2002) A key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM Conference on Computer and Communications Security. ACM, pp 41\u201347","DOI":"10.1145\/586110.586117"},{"key":"2097_CR11","doi-asserted-by":"crossref","unstructured":"Goyal V, Pandey O, Sahai A, Waters B (2006) Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of the 13th ACM Conference on Computer and Communications Security. ACM, pp 89\u201398","DOI":"10.1145\/1180405.1180418"},{"key":"2097_CR12","volume-title":"Guide to elliptic curve cryptography","author":"D Hankerson","year":"2006","unstructured":"Hankerson D, Menezes AJ, Vanstone S (2006) Guide to elliptic curve cryptography. Springer, New York"},{"issue":"10","key":"2097_CR13","doi-asserted-by":"crossref","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F Hess","year":"2006","unstructured":"Hess F, Smart NP, Vercauteren F (2006) The eta pairing revisited. IEEE Trans Inf Theory 52(10):4595\u20134602","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"2097_CR14","first-page":"293","volume":"145","author":"A Karabutsa","year":"1962","unstructured":"Karabutsa A, Ofman Y (1962) Multiplication of many-digital numbers by automatic computers. Dokl Akad Nauk SSSR 145(2):293\u2013294","journal-title":"Dokl Akad Nauk SSSR"},{"issue":"4","key":"2097_CR15","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.1109\/TIT.2009.2013048","volume":"55","author":"E Lee","year":"2009","unstructured":"Lee E, Lee HS, Park CM (2009) Efficient and generalized pairing computation on abelian varieties. IEEE Trans Inf Theory 55(4):1793\u20131803","journal-title":"IEEE Trans Inf Theory"},{"key":"2097_CR16","doi-asserted-by":"crossref","unstructured":"Matsuda S, Kanayama N, Hess F, Okamoto E (2007) Optimised versions of the ate and twisted ate pairings. In: IMA International Conference on Cryptography and Coding. Springer, New York, pp 302\u2013312","DOI":"10.1007\/978-3-540-77272-9_18"},{"key":"2097_CR17","doi-asserted-by":"crossref","unstructured":"Oliveira L, Scott M, Lopez J, Dahab R, et al. (2008) TinyPBC: pairings for authenticated identity-based non-interactive key distribution in sensor networks. In: Proceedings of INSS 2008-5th International Conference on Networked Sensing Systems","DOI":"10.1109\/INSS.2008.4610921"},{"issue":"3","key":"2097_CR18","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.comcom.2010.05.013","volume":"34","author":"LB Oliveira","year":"2011","unstructured":"Oliveira LB, Aranha DF, Gouv\u00eaa CP, Scott M, C\u00e2mara DF, L\u00f3pez J, Dahab R (2011) TinyPBC: pairings for authenticated identity-based non-interactive key distribution in sensor networks. Comput Commun 34(3):485\u2013493","journal-title":"Comput Commun"},{"key":"2097_CR19","doi-asserted-by":"crossref","unstructured":"Oliveira LB, Aranha DF, Morais E, Daguano F, L\u00f3pez J, Dahab R (2007) TinyTate: computing the tate pairing in resource-constrained sensor nodes. In: Network Computing and Applications, 2007. NCA 2007. Sixth IEEE International Symposium on IEEE, pp 318\u2013323","DOI":"10.1109\/NCA.2007.48"},{"issue":"5","key":"2097_CR20","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1023\/A:1016598314198","volume":"8","author":"A Perrig","year":"2002","unstructured":"Perrig A, Szewczyk R, Tygar JD, Wen V, Culler DE (2002) SPINS: security protocols for sensor networks. Wirel Netw 8(5):521\u2013534","journal-title":"Wirel Netw"},{"key":"2097_CR21","doi-asserted-by":"crossref","unstructured":"Sahai A, Waters B (2005) Fuzzy identity-based encryption. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, New York, pp 457\u2013473","DOI":"10.1007\/11426639_27"},{"key":"2097_CR22","first-page":"192","volume":"2007","author":"M Scott","year":"2007","unstructured":"Scott M (2007) Optimal irreducible polynomials for \n                        $$GF(2^m)$$\n                        \n                            \n                                \n                                    G\n                                    F\n                                    (\n                                    \n                                        2\n                                        m\n                                    \n                                    )\n                                \n                            \n                        \n                     arithmetic. IACR Cryptol ePrint Arch 2007:192","journal-title":"IACR Cryptol ePrint Arch"},{"key":"2097_CR23","unstructured":"Shamir A (1984) Identity-based cryptosystems and signature schemes. In: Workshop on the Theory and Application of Cryptographic Techniques. Springer, New York, pp 47\u201353"},{"issue":"5","key":"2097_CR24","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1587\/transinf.E92.D.909","volume":"92","author":"M Shirase","year":"2009","unstructured":"Shirase M, Miyazaki Y, Takagi T, Dong-Guk H, Dooho C (2009) Efficient implementation of pairing-based cryptography on a sensor node. IEICE Trans Inf Syst 92(5):909\u2013917","journal-title":"IEICE Trans Inf Syst"},{"key":"2097_CR25","doi-asserted-by":"crossref","unstructured":"Szczechowiak P, Kargl A, Scott M, Collier M (2009) On the application of pairing based cryptography to wireless sensor networks. In: Proceedings of the Second ACM Conference on Wireless Network Security. ACM, pp 1\u201312","DOI":"10.1145\/1514274.1514276"},{"key":"2097_CR26","doi-asserted-by":"crossref","unstructured":"Szczechowiak P, Oliveira LB, Scott M, Collier M, Dahab R (2008) NanoECC: testing the limits of elliptic curve cryptography in sensor networks. In: Wireless Sensor Networks. Springer, New York, pp 305\u2013320","DOI":"10.1007\/978-3-540-77690-1_19"},{"key":"2097_CR27","first-page":"463","volume":"2007","author":"G Takahashi","year":"2007","unstructured":"Takahashi G, Hoshino F, Kobayashi T (2007) Efficient \n                        $$GF(3^m)$$\n                        \n                            \n                                \n                                    G\n                                    F\n                                    (\n                                    \n                                        3\n                                        m\n                                    \n                                    )\n                                \n                            \n                        \n                     multiplication algorithm for \n                        $$\\eta _T$$\n                        \n                            \n                                \n                                    \u03b7\n                                    T\n                                \n                            \n                        \n                     pairing. IACR Cryptol ePrint Arch 2007:463","journal-title":"IACR Cryptol ePrint Arch"},{"key":"2097_CR28","unstructured":"Texas instruments: MSP430 F1611 datasheet. \n                        http:\/\/www-s.ti.com\/sc\/ds\/msp430f1611.pdf"},{"issue":"1","key":"2097_CR29","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2010","unstructured":"Vercauteren F (2010) Optimal pairings. IEEE Trans Inf Theory 56(1):455\u2013461","journal-title":"IEEE Trans Inf Theory"},{"issue":"6","key":"2097_CR30","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10207-008-0054-1","volume":"7","author":"CA Zhao","year":"2008","unstructured":"Zhao CA, Zhang F, Huang J (2008) A note on the ate pairing. Int J Inf Secur 7(6):379\u2013382","journal-title":"Int J Inf Secur"},{"key":"2097_CR31","doi-asserted-by":"crossref","unstructured":"Zhu S, Setia S, Jajodia S (2003) LEAP: efficient security mechanisms for large-scale distributed sensor networks. In: Proceedings of the 10th ACM Conference on Computer and Communications Security. ACM, pp 62\u201372","DOI":"10.1145\/948109.948120"}],"updated-by":[{"DOI":"10.1007\/s11227-018-2320-y","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2018,3,13]],"date-time":"2018-03-13T00:00:00Z","timestamp":1520899200000}}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-017-2097-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2097-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2097-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,26]],"date-time":"2018-02-26T10:52:52Z","timestamp":1519642372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-017-2097-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,17]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["2097"],"URL":"https:\/\/doi.org\/10.1007\/s11227-017-2097-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,17]]}}}