{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:43:11Z","timestamp":1725496991895},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540772712"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77272-9_20","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:56:55Z","timestamp":1196942215000},"page":"336-345","source":"Crossref","is-referenced-by-count":0,"title":["Constructing Pairing-Friendly Elliptic Curves Using Gr\u00f6bner Basis Reduction"],"prefix":"10.1007","author":[{"given":"Waldyr D.","family":"Benits Junior","sequence":"first","affiliation":[]},{"given":"Steven D.","family":"Galbraith","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","volume-title":"Graduate Studies in Math","author":"W. Adams.","year":"1994","unstructured":"Adams, W., Loustaunau, P.: An introduction to Grobner bases. In: Graduate Studies in Math, vol.\u00a03, Oxford University Press, New York (1994)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Avanzi, R., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of elliptic and hyperelliptic curve cryptography. In: Discrete Mathematics and its Applications, Chapman & Hall\/CRC (2006)","DOI":"10.1201\/9781420034981"},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s001459900040","volume":"11","author":"R. Balasubramanian","year":"1998","unstructured":"Balasubramanian, R., Koblitz, N.: The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm. Journal of Cryptology\u00a011(2), 141\u2013145 (1998)","journal-title":"Journal of Cryptology"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-36413-7_19","volume-title":"Security in Communication Networks","author":"P. Barreto","year":"2003","unstructured":"Barreto, P., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 263\u2013273. Springer, Heidelberg (2003)"},{"key":"20_CR5","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. Barreto","year":"2006","unstructured":"Barreto, P., 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":"20_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546570","volume-title":"Advances in elliptic curve cryptography","author":"I. Blake","year":"2005","unstructured":"Blake, I., Seroussi, G., Smart, N.: Advances in elliptic curve cryptography. Cambridge University Press, Cambridge (2005)"},{"key":"20_CR7","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":"20_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: The user language. Journal of Symbolic Computation\u00a024, 235\u2013265 (1997)","journal-title":"Journal of Symbolic Computation"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10623-004-3808-4","volume":"37","author":"F. Brezing","year":"2005","unstructured":"Brezing, F., Weng, A.: Elliptic curves suitable for pairing based cryptography. Codes and Cryptography\u00a037, 133\u2013141 (2005)","journal-title":"Codes and Cryptography"},{"key":"20_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2181-2","volume-title":"Ideals, varieties and algorithms: an introduction to computational algebraic geometry and commutative algebra","author":"D.A. Cox","year":"1992","unstructured":"Cox, D.A., Little, J.B., O\u2019Shea, D.: Ideals, varieties and algorithms: an introduction to computational algebraic geometry and commutative algebra. Springer, Heidelberg (1992)"},{"key":"20_CR11","unstructured":"Duan, P., Cui, S., Chan, C.W.: Effective polynomial families for generating more pairing-friendly elliptic curves. Cryptology ePrint Archive, Report 2005\/236 (2005), http:\/\/eprint.iacr.org\/2005\/236"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1007\/11792086_32","volume-title":"ANTS-VII","author":"D. Freeman","year":"2006","unstructured":"Freeman, D.: Constructing pairing-friendly elliptic curves with embedding degree 10. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS-VII. LNCS, vol.\u00a04076, pp. 452\u2013465. Springer, Heidelberg (2006)"},{"key":"20_CR13","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves, Cryptology ePrint Archive, Report 2006\/372 (2006), http:\/\/eprint.iacr.org\/2006\/372"},{"key":"20_CR14","unstructured":"Galbraith, S.D., McKee, J.F., Valenca, P.C.: Ordinary abelian varieties having small embedding degree, Finite Fields and Applications. http:\/\/eprint.iacr.org\/2004\/365 (to appear)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"ANTS IV","author":"A. Joux","year":"2000","unstructured":"Joux, A.: A one-round protocol for tripartite Diffie-Hellman. In: Bosma, W. (ed.) ANTS IV. LNCS, vol.\u00a01838, pp. 385\u2013394. Springer, Heidelberg (2000)"},{"issue":"5","key":"20_CR16","first-page":"1234","volume":"E84-A","author":"A. Miyaji","year":"2001","unstructured":"Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Transactions on Fundamentals\u00a0E84-A(5), 1234\u20131243 (2001)","journal-title":"IEICE Transactions on Fundamentals"},{"key":"20_CR17","unstructured":"Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: 2000 Symposium on Cryptography and Information Security (SCIS2000), Okinawa, Japan (2000)"},{"key":"20_CR18","unstructured":"Scott, M.: Generating families of pairing-friendly elliptic curves (Preprint, 2006)"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77272-9_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:06:56Z","timestamp":1619521616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77272-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540772712"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77272-9_20","relation":{},"subject":[]}}