{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:06:05Z","timestamp":1743087965057,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174544"},{"type":"electronic","value":"9783642174551"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17455-1_28","type":"book-chapter","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T15:31:49Z","timestamp":1290007909000},"page":"450-466","source":"Crossref","is-referenced-by-count":20,"title":["High Speed Flexible Pairing Cryptoprocessor on FPGA Platform"],"prefix":"10.1007","author":[{"given":"Santosh","family":"Ghosh","sequence":"first","affiliation":[]},{"given":"Debdeep","family":"Mukhopadhyay","sequence":"additional","affiliation":[]},{"given":"Dipanwita","family":"Roychowdhury","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Niederhagen, R., Schwabe, P.: New software speed records for cryptographic pairings. Cryptology ePrint Archive, Report 2010\/186, http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-14712-8_7"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-13013-7_13","volume-title":"PKC 2010","author":"R. Granger","year":"2010","unstructured":"Granger, R., Scott, M.: Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 209\u2013223. Springer, Heidelberg (2010)"},{"key":"28_CR3","unstructured":"Ghosh, S., Mukhopadhyay, D., Roychowdhury, D.: High Speed F p Multipliers and Adders on FPGA Platform. In: DASIP 2010, Scotland (2010)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Beuchat, J.L., D\u00edaz, J.E.G., Mitsunari, S., Okamoto, E., Henr\u00edquez, F.R., Teruya, T.: High-Speed Software Implementation of the Optimal Ate Pairing over Barreto-Naehrig Curves. Cryptology ePrint Archive, Report 2010\/354, http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-17455-1_2"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/978-3-642-04138-9_19","volume-title":"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":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/978-3-642-04138-9_18","volume-title":"CHES 2009","author":"J. Fan","year":"2009","unstructured":"Fan, J., Vercauteren, F., Verbauwhede, I.: Faster F p -arithmetic for cryptographic pairings on Barreto-Naehrig curves. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol.\u00a05747, pp. 240\u2013253. Springer, Heidelberg (2009)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-03298-1_6","volume-title":"Pairing 2009","author":"M. Scott","year":"2009","unstructured":"Scott, M., Benger, N., Charlemagne, M., Perez, L.J.D., Kachisa, E.J.: On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 78\u201388. Springer, Heidelberg (2009)"},{"key":"28_CR8","unstructured":"Lee, E., Lee, H.S., Park, C.M.: Efficient and generalized pairing computation on abelian varieties. Cryptology ePrint Archive, Report 2009\/040, http:\/\/eprint.iacr.org\/"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Beuchat, J., Detrey, J., Estibals, N., Okamoto, E., Rodr\u00edguez-Henr\u00edguez, F.: Hardware accelerator for the Tate pairing in characteristic three based on Karatsuba-Ofman multipliers. Cryptology ePrint Archive, Report 2009\/122 (2009)","DOI":"10.1007\/978-3-642-04138-9_17"},{"key":"28_CR10","unstructured":"Xilinx ISE Design Suit (2009), http:\/\/www.xilinx.com\/tools\/designtools.htm"},{"key":"28_CR11","volume-title":"An introduction to mathmatical cryptography","author":"J. Hoffstein","year":"2008","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: An introduction to mathmatical cryptography. Springer, Heidelberg (2008)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Barenghi, A., Bertoni, G., Breveglieri, L., Pelosi, G.: A FPGA coprocessor for the cryptographic Tate pairing over F p . In: Proc. Fifth Intl. Conf. Information Technology: New Generations - ITNG 2008, pp. 112\u2013119 (2008)","DOI":"10.1109\/ITNG.2008.260"},{"key":"28_CR13","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":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-540-89754-5_29","volume-title":"INDOCRYPT 2008","author":"C. Rebeiro","year":"2008","unstructured":"Rebeiro, C., Mukhopadhyay, D.: High speed compact elliptic curve cryptoprocessor for FPGA platforms. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol.\u00a05365, pp. 376\u2013388. Springer, Heidelberg (2008)"},{"key":"28_CR15","unstructured":"Hankerson, D., Menezes, A., Scott, M.: Software implementation of pairings. In: Joye, M., Neven, G. (eds.) Identity-Based Cryptography (2008)"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-73489-5_10","volume-title":"Pairing 2007","author":"A.J. Devegili","year":"2007","unstructured":"Devegili, A.J., Scott, M., Dahab, R.: Implementing cryptographic pairings over Barreto-Naehrig curves. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 197\u2013207. Springer, Heidelberg (2007)"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Barke, E., Barker, W., Burr, W., Polk, W., Smid, M.: Recommendation for key management - part 1: General (revised). National Institute of Standards and Technology, NIST Special Publication 800-57 (2007)","DOI":"10.6028\/NIST.SP.800-57p1r2007"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Shu, C., Kwon, S., Gaj, K.: FPGA accelerated Tate pairing based cryptosystems over binary fields. In: FPT 2006, pp. 173\u2013180 (2006)","DOI":"10.1109\/FPT.2006.270309"},{"key":"28_CR19","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)"},{"issue":"10","key":"28_CR20","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.P., Vercauteren, F.: The Eta pairing revisited. IEEE Transactions on Information Theory\u00a052(10), 4595\u20134602 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"28_CR21","unstructured":"Devegili, A., \u00d3h\u00c9igeartaigh, C., Scott, M., Dahab, R.: Multiplication and squaring on pairing-friendly fields. Cryptology ePrint Archive, Report 2006\/471 (2006)"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Amanor, D.N., Paar, C., Pelzl, J., Bunimov, V., Schimmler, M.: Efficient hardware architectures for modular multiplication on FPGAs. In: International Conference on Field Programmable Logic and Applications 2005, pp. 539\u2013542 (2005)","DOI":"10.1109\/FPL.2005.1515780"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/11496618_13","volume-title":"ICISC 2004","author":"S. Chatterjee","year":"2005","unstructured":"Chatterjee, S., Sarkar, P., Barua, R.: Efficient computation of Tate pairing in projective coordinate over general characteristic fields. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 168\u2013181. Springer, Heidelberg (2005)"},{"key":"28_CR24","series-title":"London Mathematical Society Lecture Note Series","volume-title":"Advances in Elliptic Curve Cryptography","author":"S. Galbraith","year":"2005","unstructured":"Galbraith, S.: Pairings. In: Blake, I.F., Seroussi, G., Smart, N.P. (eds.) Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Note Series, ch. IX, Cambridge University Press, Cambridge (2005)"},{"key":"28_CR25","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"},{"key":"28_CR26","volume-title":"ASAP 2003","author":"V. Bunimov","year":"2003","unstructured":"Bunimov, V., Schimmler, M.: Area and time efficient modular multiplication of large integers. In: ASAP 2003. IEEE Computer Society, Los Alamitos (2003)"},{"key":"28_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"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\u2013368. Springer, Heidelberg (2002)"},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/3-540-36400-5_22","volume-title":"CHES 2002","author":"M. Joye","year":"2003","unstructured":"Joye, M., Yen, S.M.: The Montgomery powering ladder. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 291\u2013302. Springer, Heidelberg (2003)"},{"key":"28_CR29","doi-asserted-by":"crossref","unstructured":"Hauck, S., Hosler, M.M., Fry, T.W.: High-performance carry chains for FPGAs. In: FPGA 1998, pp. 223\u2013233 (1998)","DOI":"10.1145\/275107.275142"},{"issue":"5","key":"28_CR30","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1109\/TC.1983.1676262","volume":"C-32","author":"G.R. Blakley","year":"1983","unstructured":"Blakley, G.R.: A computer algorithm for calculating the product A*B modulo M. IEEE Transactions on Computers\u00a0C-32(5), 497\u2013500 (1983)","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"28_CR31","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1109\/TC.1985.1676574","volume":"C-34","author":"K.R. Sloan","year":"1985","unstructured":"Sloan, K.R.: Comments on a computer algorithm for calculating the product A*B modulo M. IEEE Transactions on Computers\u00a0C-34(3), 290\u2013292 (1985)","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography - Pairing 2010"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17455-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T01:16:37Z","timestamp":1740705397000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-17455-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174544","9783642174551"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17455-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}