{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:39:20Z","timestamp":1742913560200,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031823794"},{"type":"electronic","value":"9783031823800"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-82380-0_5","type":"book-chapter","created":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T10:16:09Z","timestamp":1739873769000},"page":"156-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constructing Families of\u00a0Pairing-Friendly Elliptic Curves with\u00a0Small $$\\rho $$-Value and\u00a0Rational Solutions of\u00a0Some Systems of\u00a0Polynomial Equations"],"prefix":"10.1007","author":[{"given":"Robert","family":"Dry\u0142o","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,19]]},"reference":[{"key":"5_CR1","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: Security in Communication Networks-SCN 2002. LNCS, vol. 2576, pp. 263\u2013273. Springer, Berlin (2002)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Selected Areas in Cryptography\u2013SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Berlin (2006)","DOI":"10.1007\/11693383_22"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Advances in Cryptology\u2013Crytpo 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Berlin (2001). Full version: SIAM J. Comput. 32, 586\u2013615 (2003)","DOI":"10.1137\/S0097539701398521"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Advances in Cryptology\u2013Asiacrypt 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Berlin (2002). Full version: J. Cryptol. 17, 297\u2013319 (2004)","DOI":"10.1007\/s00145-004-0314-9"},{"issue":"5","key":"5_CR5","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1016\/j.jnt.2010.05.001","volume":"131","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Rubin, K., Silverberg, A.: Finding composite order ordinary elliptic curves using the Cocks-Pinch method. J. Number Theory 131(5), 832\u2013841 (2011)","journal-title":"J. Number Theory"},{"key":"5_CR6","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. Des. Codes Cryptogr. 37, 133\u2013141 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Cha, J.C., Cheon, J.H.: An identity-based signature from gap Diffie-Hellman groups. In: Public-Key Cryptography-PKC 2003. LNCS, vol. 2567, pp. 18\u201330. Springer, Berlin (2003)","DOI":"10.1007\/3-540-36288-6_2"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Dry\u0142o, R.: On constructing families of pairing-friendly elliptic curves with variable discriminant. In: Indocrypt-2011. LNCS, vol. 7107, pp. 310\u2013319. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-25578-6_22"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Dry\u0142o, R.: On constructing optimal families of pairing-friendly elliptic curves. Preprint IMPAN (no. 715) (2010). https:\/\/www.impan.pl\/pl\/wydawnictwa\/preprinty-impan","DOI":"10.1007\/978-3-642-25578-6_22"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00145-004-0219-7","volume":"18","author":"R Dupont","year":"2005","unstructured":"Dupont, R., Enge, A., Morain, F.: Building elliptic curves with arbitrary small MOV degree over finite prime fields. J. Cryptol. 18, 79\u201389 (2005)","journal-title":"J. Cryptol."},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1515\/jmc-2017-0024","volume":"12","author":"G Fotiadis","year":"2018","unstructured":"Fotiadis, G., Konstantinou, E.: Generating pairing-friendly elliptic curve parameters using sparse families. J. Math. Cryptol. 12(2), 83\u201399 (2018)","journal-title":"J. Math. Cryptol."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Fotiadis, G., Konstantinou, E.: More sparse families of pairing-friendly elliptic curves. In: International Conference on Cryptology and Network Security, pp. 384\u2013399. Springer, Cham (2014)","DOI":"10.1007\/978-3-319-12280-9_25"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2019.10.017","volume":"800","author":"G Fotiadis","year":"2019","unstructured":"Fotiadis, G., Konstantinou, E.: TNFS resistant families of pairing-friendly elliptic curves. Theoret. Comput. Sci. 800, 73\u201389 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Freeman, D.: Constructing pairing-friendly elliptic curves with embedding degree 10. In: Algorithmic Number Theory Symposium\u2013ANTS-VII. LNCS, vol. 4076, pp. 452\u2013465. Springer, Berlin (2006)","DOI":"10.1007\/11792086_32"},{"key":"5_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. J. Cryptol. 23, 224\u2013280 (2010)","journal-title":"J. Cryptol."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.ffa.2007.02.003","volume":"13","author":"S Galbraith","year":"2007","unstructured":"Galbraith, S., McKee, J., Valen\u00e7a, P.: Ordinary abelian varieties having small embedding degree. Finite Fields Appl. 13, 800\u2013814 (2007)","journal-title":"Finite Fields Appl."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Grze\u015bkowiak, M.: Algorithms for pairing-friendly primes. In: International Conference on Pairing-Based Cryptography, pp. 215\u2013228. Springer, Cham (2013)","DOI":"10.1007\/978-3-319-04873-4_13"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Guillevic, A.: A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level. In: IACR International Conference on Public-Key Cryptography, pp. 535\u2013564. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-45388-6_19"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. In: Algorithmic Number Theory Symposium\u2013ANTS-IV. LNCS, vol. 1838, pp. 385\u2013393. Springer, Berlin (2000). Full version: J. Cryptol. 17, 263\u2013276 (2004)","DOI":"10.1007\/s00145-004-0312-y"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Kachisa, E., Schaefer, E., Scott, M.: Constructing Brezing-Weng pairing friendly elliptic curves using elements in the cyclotomic field. In: Pairing-Based Cryptography\u2013Pairing 2008. LNCS, vol. 5209, pp. 126\u2013135. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-85538-5_9"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curves traces for FR-reduction. IEICE Trans. Fundam. E84-A, 1234\u20131243 (2001)","DOI":"10.1007\/3-540-45247-8_8"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1049\/el:20020682","volume":"38","author":"K Paterson","year":"2002","unstructured":"Paterson, K.: ID-based signatures from pairings on elliptic curves. Electron. Lett. 38, 1025\u20131026 (2002)","journal-title":"Electron. Lett."},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10623-005-0538-1","volume":"38","author":"M Scott","year":"2006","unstructured":"Scott, M., Barreto, P.S.L.M.: Generating more MNT elliptic curves. Des. Codes Cryptogr. 38, 209\u2013217 (2006)","journal-title":"Des. Codes Cryptogr."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Scott, M., Guillevic, A.: A new family of pairing-friendly elliptic curves. In: Arithmetic of Finite Fields: 7th International Workshop, WAIFI 2018, Bergen, Norway, 14\u201316 June 2018, Revised Selected Papers 7, pp. 43\u201357. Springer (2018)","DOI":"10.1007\/978-3-030-05153-2_2"},{"key":"5_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The Arithmetic of Elliptic Curves","author":"J Silverman","year":"1986","unstructured":"Silverman, J.: The Arithmetic of Elliptic Curves. Springer, Berlin (1986)"},{"issue":"1","key":"5_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc-2013-0017","volume":"9","author":"K Yoon","year":"2015","unstructured":"Yoon, K.: A new method of choosing primitive elements for Brezing-Weng families of pairing-friendly elliptic curves. J. Math. Cryptol. 9(1), 1\u20139 (2015)","journal-title":"J. Math. Cryptol."}],"container-title":["Lecture Notes in Computer Science","Number-Theoretic Methods in Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82380-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T10:16:15Z","timestamp":1739873775000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82380-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031823794","9783031823800"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82380-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"19 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NuTMiC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Number-Theoretic Methods in Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Szczecin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numtmic2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nutmic2024.usz.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}