{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:59:03Z","timestamp":1753275543966},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642363337"},{"type":"electronic","value":"9783642363344"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36334-4_10","type":"book-chapter","created":{"date-parts":[[2013,1,30]],"date-time":"2013-01-30T19:55:13Z","timestamp":1359575713000},"page":"160-176","source":"Crossref","is-referenced-by-count":17,"title":["Faster Pairing Coprocessor Architecture"],"prefix":"10.1007","author":[{"given":"Gavin Xiaoxu","family":"Yao","sequence":"first","affiliation":[]},{"given":"Junfeng","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Ray C. C.","family":"Cheung","sequence":"additional","affiliation":[]},{"given":"Ingrid","family":"Verbauwhede","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Aranha, D., Beuchat, J.L., Detrey, J., Estibals, N.: Optimal eta pairing on supersingular genus-2 binary hyperelliptic curves. Cryptology ePrint Archive, Report 2010\/559 (2010), \n                    \n                      http:\/\/eprint.iacr.org\/","key":"10_CR1"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-20465-4_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D.F. Aranha","year":"2011","unstructured":"Aranha, D.F., Karabina, K., Longa, P., Gebotys, C.H., L\u00f3pez, J.: Faster Explicit Formulas for Computing Pairings over Ordinary Curves. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 48\u201368. Springer, Heidelberg (2011)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-11925-5_7","volume-title":"Topics in Cryptology - CT-RSA 2010","author":"D.F. Aranha","year":"2010","unstructured":"Aranha, D.F., L\u00f3pez, J., Hankerson, D.: High-Speed Parallel Software Implementation of the \u03b7\n                  \n                    T\n                   Pairing. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol.\u00a05985, pp. 89\u2013105. Springer, Heidelberg (2010)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/ARITH.2009.20","volume-title":"ARITH 2009: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic","author":"J.C. Bajard","year":"2009","unstructured":"Bajard, J.C., Kaihara, M., Plantard, T.: Selected RNS bases for modular multiplication. In: ARITH 2009: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic, pp. 25\u201332. IEEE Computer Society, Washington, DC (2009)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"P.S.L.M. Barreto","year":"2002","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient Algorithms for Pairing-Based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 354\u2013369. Springer, Heidelberg (2002)"},{"key":"10_CR6","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":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-17455-1_2","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"J.-L. Beuchat","year":"2010","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\u2013Naehrig Curves. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 21\u201339. Springer, Heidelberg (2010)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-10433-6_28","volume-title":"Cryptology and Network Security","author":"J.-L. Beuchat","year":"2009","unstructured":"Beuchat, J.-L., L\u00f3pez-Trejo, E., Mart\u00ednez-Ramos, L., Mitsunari, S., Rodr\u00edguez-Henr\u00edquez, F.: Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol.\u00a05888, pp. 413\u2013432. Springer, Heidelberg (2009)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","first-page":"18","volume-title":"Public Key Cryptography - PKC 2003","author":"J.C. Cha","year":"2003","unstructured":"Cha, J.C., Cheon, J.H.: An Identity-Based Signature from Gap Diffie-Hellman Groups. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 18\u201330. Springer, Heidelberg (2003)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-23951-9_28","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"R.C.C. Cheung","year":"2011","unstructured":"Cheung, R.C.C., Duquesne, S., Fan, J., Guillermin, N., Verbauwhede, I., Yao, G.X.: FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol.\u00a06917, pp. 421\u2013441. Springer, Heidelberg (2011)"},{"unstructured":"Dutta, R., Barua, R., Sarkar, P.: Pairing-based cryptographic protocols: A survey. Cryptology ePrint Archive, Report 2004\/064 (2004)","key":"10_CR12"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-17455-1_25","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"N. Estibals","year":"2010","unstructured":"Estibals, N.: Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 397\u2013416. Springer, Heidelberg (2010)"},{"issue":"5","key":"10_CR14","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1109\/TC.2011.78","volume":"61","author":"J. Fan","year":"2012","unstructured":"Fan, J., Vercauteren, F., Verbauwhede, I.: Efficient hardware implementation of \n                    \n                      \n                    \n                    $\\mathbb{F}_p$\n                  -arithmetic for pairing-friendly curves. IEEE Transactions on Computers\u00a061(5), 676\u2013685 (2012)","journal-title":"IEEE Transactions on Computers"},{"key":"10_CR15","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, 224\u2013280 (2010)","journal-title":"Journal of Cryptology"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-642-17455-1_28","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"S. Ghosh","year":"2010","unstructured":"Ghosh, S., Mukhopadhyay, D., Roychowdhury, D.: High Speed Flexible Pairing Cryptoprocessor on FPGA Platform. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 450\u2013466. Springer, Heidelberg (2010)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-642-23951-9_29","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"S. Ghosh","year":"2011","unstructured":"Ghosh, S., Roychowdhury, D., Das, A.: High Speed Cryptoprocessor for \u03b7\n                  \n                    T\n                   Pairing on 128-bit Secure Supersingular Elliptic Curves over Characteristic Two Fields. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol.\u00a06917, pp. 442\u2013458. Springer, Heidelberg (2011)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-04159-4_3","volume-title":"Selected Areas in Cryptography","author":"P. Grabher","year":"2009","unstructured":"Grabher, P., Gro\u00dfsch\u00e4dl, J., Page, D.: On Software Parallel Implementation of Cryptographic Pairings. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol.\u00a05381, pp. 35\u201350. Springer, Heidelberg (2009)"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J. Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient Non-interactive Proof Systems for Bilinear Groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 415\u2013432. Springer, Heidelberg (2008)"},{"unstructured":"Hankerson, D., Menezes, A., Scott, M.: Software Implementation of Pairings. Cryptology and Information Security Series, vol.\u00a02, pp. 188\u2013206. IOS Press (2009)","key":"10_CR20"},{"issue":"10","key":"10_CR21","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., Vercauteren, F.: The Eta pairing revisited. IEEE Transactions on Information Theory\u00a052(10), 4595\u20134602 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A. Joux","year":"2004","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. Journal of Cryptology\u00a017, 263\u2013276 (2004)","journal-title":"Journal of Cryptology"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-04138-9_19","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2009","author":"D. Kammler","year":"2009","unstructured":"Kammler, D., Zhang, D., Schwabe, P., Scharwaechter, H., Langenberg, M., Auras, D., Ascheid, G., Mathar, R.: Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol.\u00a05747, pp. 254\u2013271. Springer, Heidelberg (2009)"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/3-540-45539-6_37","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"S.-I. Kawamura","year":"2000","unstructured":"Kawamura, S.-I., Koike, M., Sano, F., Shimbo, A.: Cox-Rower Architecture for Fast Parallel Montgomery Multiplication. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 523\u2013538. Springer, Heidelberg (2000)"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic Curve Cryptosystem. Mathematics of Computation\u00a048, 203\u2013209 (1987)","journal-title":"Mathematics of Computation"},{"issue":"4","key":"10_CR26","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1109\/TIT.2009.2013048","volume":"55","author":"E. Lee","year":"2009","unstructured":"Lee, E., Lee, H.S., Park, C.M.: Efficient and generalized pairing computation on abelian varieties. IEEE Transactions on Information Theory\u00a055(4), 1793\u20131803 (2009)","journal-title":"IEEE Transactions on Information Theory"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"V.S. Miller","year":"1986","unstructured":"Miller, V.S.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"10_CR28","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. Journal of Cryptology\u00a017, 235\u2013261 (2004)","journal-title":"Journal of Cryptology"},{"issue":"170","key":"10_CR29","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation\u00a044(170), 519\u2013521 (1985)","journal-title":"Mathematics of Computation"},{"key":"10_CR30","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 \u2013 LATINCRYPT 2010","author":"M. Naehrig","year":"2010","unstructured":"Naehrig, M., Niederhagen, R., Schwabe, P.: New Software Speed Records for Cryptographic Pairings. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol.\u00a06212, pp. 109\u2013123. Springer, Heidelberg (2010)"},{"unstructured":"Parhami, B.: Computer Arithmetic: Algorithms and Hardware Designs. Oxford University Press (2000)","key":"10_CR31"},{"key":"10_CR32","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02238608","volume":"50","author":"K. Posch","year":"1993","unstructured":"Posch, K., Posch, R.: Base extension using a convolution sum in residue number systems. Computing\u00a050, 93\u2013104 (1993)","journal-title":"Computing"},{"issue":"5","key":"10_CR33","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/71.382314","volume":"6","author":"K. Posch","year":"1995","unstructured":"Posch, K., Posch, R.: Modulo reduction in residue number systems. IEEE Transactions on Parallel and Distributed Systems\u00a06(5), 449\u2013454 (1995)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"2","key":"10_CR34","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"unstructured":"Scott, M.: Implementing cryptographic pairings. In: Pairing-Based Cryptography - Pairing 2007. LNCS, vol. 4575, pp. 117\u2013196. Springer (2007)","key":"10_CR35"},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-85053-3_6","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2008","author":"R. Szerwinski","year":"2008","unstructured":"Szerwinski, R., G\u00fcneysu, T.: Exploiting the Power of GPUs for Asymmetric Cryptography. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol.\u00a05154, pp. 79\u201399. Springer, Heidelberg (2008)"},{"issue":"1","key":"10_CR37","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)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography \u2013 Pairing 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36334-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T20:03:00Z","timestamp":1557518580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36334-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642363337","9783642363344"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36334-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}