{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:57:11Z","timestamp":1759147031356},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540004097"},{"type":"electronic","value":"9783540364009"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36400-5_38","type":"book-chapter","created":{"date-parts":[[2007,9,2]],"date-time":"2007-09-02T23:59:37Z","timestamp":1188777577000},"page":"529-539","source":"Crossref","is-referenced-by-count":29,"title":["Hardware Implementation of Finite Fields of Characteristic Three"],"prefix":"10.1007","author":[{"given":"D.","family":"Page","sequence":"first","affiliation":[]},{"given":"N.P.","family":"Smart","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,17]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s001450010012","volume":"14","author":"D. Bailey","year":"2001","unstructured":"D. Bailey and C. Paar. Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. J. Cryptology, 14, 153\u2013176, 2001.","journal-title":"J. Cryptology"},{"key":"38_CR2","series-title":"Lect Notes Comput Sci","first-page":"2442","volume-title":"Advances in Cryptology-CRYPTO 2002","author":"P.S.L.M. Barreto","year":"2002","unstructured":"P.S.L.M. Barreto, H.Y. Kim and M. Scott. Efficient algorithms for pairing-based cryptosystems. To appear Advances in Cryptology-CRYPTO 2002, Springer LNCS2442, 2002."},{"key":"38_CR3","series-title":"Lect Notes Comput Sci","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":"D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In Advances in Cryptology-CRYPTO 2001, Springer-Verlag LNCS 2139, 213\u2013229, 2001."},{"key":"38_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology-ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"D. Boneh, B Lynn and H. Shacham. Short signatures from the Weil pairing. In Advances in Cryptology-ASIACRYPT 2001, Springer-Verlag LNCS 2248, 514\u2013532, 2001."},{"key":"38_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-45682-1_29","volume-title":"Advances in Cryptology-ASIACRYPT 2001","author":"S.D. Galbraith","year":"2001","unstructured":"S.D. Galbraith. Supersingular curves in cryptography. InAdvances in Cryptology-ASIACRYPT 2001, Springer-Verlag LNCS 2248, 495\u2013513, 2001."},{"key":"38_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","volume-title":"Algorithmic Number Theory Symposium, ANTS-V","author":"S.D. Galbraith","year":"2002","unstructured":"S.D. Galbraith, K. Harrison and D. Soldera. Implementing the Tate pairing. Algorithmic Number Theory Symposium, ANTS-V, Springer-Verlag LNCS 2369, 324\u2013337, 2002."},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"K. Harrison, D. Page and N.P. Smart. Software implementation of finite fields in characteristic three. Preprint, 2002.","DOI":"10.1112\/S1461157000000747"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"F. Hess. Efficient Identity based Signature Schemes based on Pairings To appear Selected Areas in Cryptography 2002.","DOI":"10.1007\/3-540-36492-7_20"},{"key":"38_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Algorithmic Number Theory Symposium, ANTS-IV","author":"A. Joux","year":"2000","unstructured":"A. Joux. A one round protocol for tripartite Diffie-Hellman. In Algorithmic Number Theory Symposium, ANTS-IV, Springer-Verlag LNCS 1838, 385\u2013394, 2000."},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A.J. Menezes","year":"1993","unstructured":"A.J. Menezes, T. Okamoto and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Info. Th., 39, 1639\u20131646, 1993.","journal-title":"IEEE Trans. Info. Th."},{"key":"38_CR11","unstructured":"V. Miller. Short programs for functions on curves. Unpublished manuscript, 1986."},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"P.L. Montgomery. Modular multiplication without trial division. Math. Comp., 44, 519\u2013521, 1985.","journal-title":"Math. Comp."},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"K. Paterson. ID-based Signatures from Pairings on Elliptic Curves. Preprint 2002.","DOI":"10.1049\/el:20020682"},{"key":"38_CR14","unstructured":"R. Sakai, K. Ohgishi and M. Kasahara. Cryptosystems based on pairing. In SCIS 2000, 2000."}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems - CHES 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36400-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T19:40:02Z","timestamp":1556826002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36400-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540004097","9783540364009"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-36400-5_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}