{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:34:58Z","timestamp":1761647698725},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041372"},{"type":"electronic","value":"9783642041389"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04138-9_19","type":"book-chapter","created":{"date-parts":[[2009,8,28]],"date-time":"2009-08-28T08:28:34Z","timestamp":1251448114000},"page":"254-271","source":"Crossref","is-referenced-by-count":34,"title":["Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves"],"prefix":"10.1007","author":[{"given":"David","family":"Kammler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diandian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Schwabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanno","family":"Scharwaechter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Langenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominik","family":"Auras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerd","family":"Ascheid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rudolf","family":"Mathar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A.J. Menezes","year":"1993","unstructured":"Menezes, A.J., Okamoto, T., Vanstone, S.A.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Information Theory\u00a039(5), 1639\u20131646 (1993)","journal-title":"IEEE Trans. Information Theory"},{"issue":"206","key":"19_CR2","first-page":"865","volume":"62","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. of Computation\u00a062(206), 865\u2013874 (1994)","journal-title":"Math. of Computation"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Algorithmic Number Theory","author":"A. Joux","year":"2000","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 385\u2013394. Springer, Heidelberg (2000)"},{"key":"19_CR4","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)"},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptology\u00a017(4), 297\u2013319 (2004)","journal-title":"J. Cryptology"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D.: A brief look at pairings based cryptography. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science \u2013 FOCS 2007, pp. 19\u201326 (2007)","DOI":"10.1109\/FOCS.2007.51"},{"key":"19_CR7","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":"19_CR8","unstructured":"Barker, E., Barker, W., Burr, W., Polk, W., Smid, M.: Recommendation for key management \u2013 part 1: General (revised). National Institute of Standards and Technology, NIST Special Publication 800-57 (2007) http:\/\/csrc.nist.gov\/publications\/nistpubs\/800-57\/sp800-57-Part1-revised2_Mar08-2007.pdf"},{"key":"19_CR9","unstructured":"N\u00e4slund, M.: Ecrypt yearly report on algorithms and keysizes (2007-2008) (2008), http:\/\/www.ecrypt.eu.org\/ecrypt1\/documents\/D.SPA.28-1.1.pdf"},{"key":"19_CR10","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-Based Cryptography \u2013 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":"19_CR11","unstructured":"Grabher, P., Gro\u00dfsch\u00e4dl, J., Page, D.: On software parallel implementation of cryptographic pairings. Cryptology ePrint Archive, Report 2008\/205 (2008), http:\/\/eprint.iacr.org\/2008\/205"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-68164-9_25","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"M. Naehrig","year":"2008","unstructured":"Naehrig, M., Barreto, P.S.L.M., Schwabe, P.: On compressible pairings and their computation. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol.\u00a05023, pp. 371\u2013388. Springer, Heidelberg (2008)"},{"key":"19_CR13","unstructured":"Devegili, A.J., Scott, M., Dahab, R.: Implementing cryptographic pairings over Barreto-Naehrig curves. Cryptology ePrint Archive, Report 2007\/309 (2007), http:\/\/eprint.iacr.org\/2007\/390"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-85538-5_20","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"J.-L. Beuchat","year":"2008","unstructured":"Beuchat, J.-L., Brisebarre, N., Detrey, J., Okamoto, E., Rodr\u00edguez-Henr\u00edquez, F.: A comparison between hardware accelerators for the modified Tate pairing over $\\mathbb{F}_{2^m}$ and $\\mathbb{F}_{3^m}$ . In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 297\u2013315. Springer, Heidelberg (2008)"},{"issue":"11","key":"19_CR15","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1109\/TC.2008.103","volume":"57","author":"J.-L. Beuchat","year":"2008","unstructured":"Beuchat, J.-L., Brisebarre, N., Detrey, J., Okamoto, E., Shirase, M., Takagi, T.: Algorithms and arithmetic operators for computing the \u03b7 t pairing in characteristic three. IEEE Trans. Comput.\u00a057(11), 1454\u20131468 (2008)","journal-title":"IEEE Trans. Comput."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Beuchat, J.-L., Shirase, M., Takagi, T., Okamoto, E.: An algorithm for the \u03b7 t pairing calculation in characteristic three and its hardware implementation. In: Proc. 18th IEEE Symp. Computer Arithmetic \u2013 ARITH 2007, pp. 97\u2013104 (2007)","DOI":"10.1109\/ARITH.2007.10"},{"key":"19_CR17","unstructured":"Beuchat, J.-L., Doi, H., Fujita, K., Inomata, A., Kanaoka, A., Katouno, M., Mambo, M., Okamoto, E., Okamoto, T., Shiga, T., Shirase, M., Soga, R., Takagi, T., Vithanage, A., Yamamoto, H.: FPGA and ASIC implementations of the \u03b7 t pairing in characteristic three. Cryptology ePrint Archive, Report 2008\/280 (2008), http:\/\/eprint.iacr.org\/2008\/280"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Shu, C., Kwon, S., Gaj, K.: FPGA accelerated Tate pairing based cryptosystems over binary fields. In: Proc. IEEE Int\u2019l Conf. Field Programmable Technology \u2013 FPT 2006, pp. 173\u2013180 (2006)","DOI":"10.1109\/FPT.2006.270309"},{"issue":"5-6","key":"19_CR19","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.compeleceng.2007.05.002","volume":"33","author":"M. Keller","year":"2007","unstructured":"Keller, M., Ronan, R., Marnane, W., Murphy, C.: Hardware architectures for the Tate pairing over GF(2 m ). Computers & Electrical Eng.\u00a033(5-6), 392\u2013406 (2007)","journal-title":"Computers & Electrical Eng."},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/11802839_44","volume-title":"Reconfigurable Computing: Architectures and Applications","author":"M. Keller","year":"2006","unstructured":"Keller, M., Kerins, T., Crowe, F., Marnane, W.: FPGA implementation of a GF(2 m ) Tate pairing architecture. In: Bertels, K., Cardoso, J.M.P., Vassiliadis, S. (eds.) ARC 2006. LNCS, vol.\u00a03985, pp. 358\u2013369. Springer, Heidelberg (2006)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Ronan, R., \u00d3 h\u00c9igeartaigh, C., Murphy, C., Scott, M., Kerins, T.: FPGA acceleration of the Tate pairing in characteristic 2. In: Proc. IEEE Int\u2019l Conf. Field Programmable Technology, pp. 213\u2013220 (2006)","DOI":"10.1109\/FPT.2006.270314"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11545262_29","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"P. Grabher","year":"2005","unstructured":"Grabher, P., Page, D.: Hardware acceleration of the Tate pairing in characteristic three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 398\u2013411. Springer, Heidelberg (2005)"},{"key":"19_CR23","unstructured":"Jiang, J.: Bilinear pairing (Eta_T pairing) IP core. Technical report (2007), http:\/\/www.cs.cityu.edu.hk\/~ecc\/doc\/etat_datasheet_v2.pdf"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/11545262_30","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"T. Kerins","year":"2005","unstructured":"Kerins, T., Marnane, W.P., Popovici, E.M., Barreto, P.S.L.M.: Efficient hardware for the Tate pairing calculation in characteristic three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 412\u2013426. Springer, Heidelberg (2005)"},{"issue":"2","key":"19_CR25","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1504\/IJHPSA.2007.015393","volume":"1","author":"R. Ronan","year":"2007","unstructured":"Ronan, R., Murphy, C., Kerins, T., \u00d3 h\u00c9igeartaigh, C., Barreto, P.S.L.M.: A flexible processor for the characteristic 3 \u03b7 t pairing. Int\u2019l J. High Performance Systems Architecture\u00a01(2), 79\u201388 (2007)","journal-title":"Int\u2019l J. High Performance Systems Architecture"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"K\u00f6m\u00fcrc\u00fc, G., Savas, E.: An efficient hardware implementation of the Tate pairing in characteristic three. In: Proc. Third Int\u2019l Conf. Systems \u2013 ICONS 2008, pp. 23\u201328 (2008)","DOI":"10.1109\/ICONS.2008.27"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Barenghi, A., Bertoni, G., Breveglieri, L., Pelosi, G.: A FPGA coprocessor for the cryptographic Tate pairing over $\\mathbb{F}_p$ . In: Proc. Fifth Int\u2019l Conf. Information Technology: New Generations \u2013 ITNG 2008, pp. 112\u2013119 (2008)","DOI":"10.1109\/ITNG.2008.260"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-73489-5_11","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"T. Vejda","year":"2007","unstructured":"Vejda, T., Page, D., Gro\u00dfsch\u00e4dl, J.: Instruction set extensions for pairing-based cryptography. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 208\u2013224. Springer, Heidelberg (2007)"},{"issue":"4","key":"19_CR29","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/TC.2003.1190586","volume":"52","author":"A. Satoh","year":"2003","unstructured":"Satoh, A., Takano, K.: A scalable dual-field elliptic curve cryptographic processor. IEEE Trans. Computers\u00a052(4), 449\u2013460 (2003)","journal-title":"IEEE Trans. Computers"},{"issue":"5","key":"19_CR30","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1109\/TCSII.2006.889459","volume":"54","author":"G. Chen","year":"2007","unstructured":"Chen, G., Bai, G., Chen, H.: A high-performance elliptic curve cryptographic processor for general curves over GF(p) based on a systolic arithmetic unit. IEEE Trans. Circuits and Systems II: Express Briefs\u00a054(5), 412\u2013416 (2007)","journal-title":"IEEE Trans. Circuits and Systems II: Express Briefs"},{"key":"19_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-85053-3_5","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2008","author":"T. G\u00fcneysu","year":"2008","unstructured":"G\u00fcneysu, T., Paar, C.: Ultra high performance ECC over NIST primes on commercial FPGAs. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol.\u00a05154, pp. 62\u201378. Springer, Heidelberg (2008)"},{"key":"19_CR32","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, Cambridge University Press, Cambridge (2005)"},{"key":"19_CR33","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. J. Cryptology\u00a017, 235\u2013261 (2004)","journal-title":"J. Cryptology"},{"issue":"10","key":"19_CR34","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 Trans. Information Theory\u00a052(10), 4595\u20134602 (2006)","journal-title":"IEEE Trans. Information Theory"},{"key":"19_CR35","unstructured":"Lee, E., Lee, H.S., Park, C.M.: Efficient and generalized pairing computation on Abelian varieties. Cryptology ePrint Archive, Report 2008\/040 (2008), http:\/\/eprint.iacr.org\/2008\/040"},{"key":"19_CR36","unstructured":"Vercauteren, F.: Optimal pairings. Cryptology ePrint Archive, Report 2008\/096 (2008), http:\/\/eprint.iacr.org\/2008\/096"},{"key":"19_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-85538-5_2","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"F. Hess","year":"2008","unstructured":"Hess, F.: Pairing lattices. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 18\u201338. Springer, Heidelberg (2008)"},{"issue":"3","key":"19_CR38","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P.S.L.M. Barreto","year":"2007","unstructured":"Barreto, P.S.L.M., Galbraith, S.D., \u00d3 h\u00c9igeartaigh, C., Scott, M.: Efficient pairing computation on supersingular Abelian varieties. Designs, Codes and Cryptography\u00a042(3), 239\u2013271 (2007)","journal-title":"Designs, Codes and Cryptography"},{"key":"19_CR39","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\u2013368. Springer, Heidelberg (2002)"},{"key":"19_CR40","unstructured":"CoWare: Processor Designer (2009), http:\/\/www.coware.com\/products\/processordesigner.php"},{"key":"19_CR41","unstructured":"National Institute of Standards and Technology, NIST: FIPS 186-2: Digital Signature Standard (DSS) (2000), http:\/\/csrc.nist.gov\/publications\/fips\/fips186-2\/fips186-2-change1.pdf"},{"key":"19_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11745853_14","volume-title":"Public Key Cryptography - PKC 2006","author":"D.J. Bernstein","year":"2006","unstructured":"Bernstein, D.J.: Curve25519: new Diffie-Hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 207\u2013228. Springer, Heidelberg (2006)"},{"issue":"170","key":"19_CR43","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P. Montgomery","year":"1985","unstructured":"Montgomery, P.: Modular multiplication without trial division. Mathematics of Computation\u00a044(170), 519\u2013521 (1985)","journal-title":"Mathematics of Computation"},{"issue":"6","key":"19_CR44","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1049\/ip-cdt:20030567","volume":"150","author":"O. Nibouche","year":"2003","unstructured":"Nibouche, O., Bouridane, A., Nibouche, M.: Architectures for Montgomery\u2019s multiplication. IEE Proc. \u2013 Computers and Digital Techniques\u00a0150(6), 361\u2013368 (2003)","journal-title":"IEE Proc. \u2013 Computers and Digital Techniques"},{"key":"19_CR45","unstructured":"Synopsys: Design Compiler (2009), http:\/\/www.synopsys.com\/products\/logic\/design_compiler.html"},{"key":"19_CR46","unstructured":"Shu, C., Kwon, S., Gaj, K.: FPGA accelerated Tate pairing based cryptosystems over binary fields. Cryptology ePrint Archive, Report 2006\/179 (2006), http:\/\/eprint.iacr.org\/2006\/179"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems - CHES 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04138-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T03:47:42Z","timestamp":1558496862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04138-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041372","9783642041389"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04138-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}