{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:02Z","timestamp":1772283482984,"version":"3.50.1"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319612720","type":"print"},{"value":"9783319612737","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-61273-7_5","type":"book-chapter","created":{"date-parts":[[2017,7,13]],"date-time":"2017-07-13T11:22:58Z","timestamp":1499944978000},"page":"83-108","source":"Crossref","is-referenced-by-count":49,"title":["Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-Based Cryptography"],"prefix":"10.1007","author":[{"given":"Alfred","family":"Menezes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Palash","family":"Sarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shashank","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,14]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-36334-4_11","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2012","author":"DF Aranha","year":"2013","unstructured":"Aranha, D.F., Fuentes-Casta\u00f1eda, L., Knapp, E., Menezes, A., Rodr\u00edguez-Henr\u00edquez, F.: Implementing pairings at the 192-bit security level. In: Abdalla, M., Lange, T. (eds.) Pairing 2012. LNCS, vol. 7708, pp. 177\u2013195. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-36334-4_11"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-662-46800-5_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"R Barbulescu","year":"2015","unstructured":"Barbulescu, R., Gaudry, P., Guillevic, A., Morain, F.: Improving NFS for the discrete logarithm problem in non-prime finite fields. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 129\u2013155. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46800-5_6"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-55220-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"R Barbulescu","year":"2014","unstructured":"Barbulescu, R., Gaudry, P., Joux, A., Thom\u00e9, E.: A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 1\u201316. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-55220-5_1"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-48800-3_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"R Barbulescu","year":"2015","unstructured":"Barbulescu, R., Gaudry, P., Kleinjung, T.: The tower number field sieve. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 31\u201355. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48800-3_2"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1112\/S1461157014000369","volume":"17","author":"R Barbulescu","year":"2014","unstructured":"Barbulescu, R., Pierrot, C.: The multiple number field sieve for medium and high characteristic finite fields. LMS J. Comput. Math. 17, 230\u2013246 (2014)","journal-title":"LMS J. Comput. Math."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Barker, E.: Recommendation for key management, Part 1: General. NIST Special Publication 800\u201357, Part 1, Revision 4, January 2016","DOI":"10.6028\/NIST.SP.800-57pt1r4"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-36413-7_19","volume-title":"Security in Communication Networks","author":"PSLM Barreto","year":"2003","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 257\u2013267. Springer, Heidelberg (2003). doi: 10.1007\/3-540-36413-7_19"},{"key":"5_CR8","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":"PSLM 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. 3897, pp. 319\u2013331. Springer, Heidelberg (2006). doi: 10.1007\/11693383_22"},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"1995","DOI":"10.1016\/j.laa.2009.08.012","volume":"432","author":"Y Bistritz","year":"2010","unstructured":"Bistritz, Y., Lifshitz, A.: Bounds for resultants of univariate and bivariate polynomials. Linear Algebra Appl. 432, 1995\u20132005 (2010)","journal-title":"Linear Algebra Appl."},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D Boneh","year":"2008","unstructured":"Boneh, D., Boyen, X.: Strong signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21, 149\u2013177 (2008)","journal-title":"J. Cryptol."},{"key":"5_CR11","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 \u2014 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. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44647-8_13"},{"key":"5_CR12","doi-asserted-by":"crossref","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. Cryptol. 17, 297\u2013319 (2004)","journal-title":"J. Cryptol."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: 11th ACM Conference on Computer and Communications Security - CCS 2004, pp. 168\u2013177 (2004)","DOI":"10.1145\/1030083.1030106"},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"1311","DOI":"10.1016\/j.dam.2011.04.021","volume":"159","author":"S Chatterjee","year":"2011","unstructured":"Chatterjee, S., Menezes, A.: On cryptographic protocols employing asymmetric pairings - the role of $$\\psi $$ revisited. Discrete Appl. Math. 159, 1311\u20131322 (2011)","journal-title":"Discrete Appl. Math."},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-662-48797-6_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"S Chatterjee","year":"2015","unstructured":"Chatterjee, S., Menezes, A.: Type 2 structure-preserving signature schemes revisited. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 286\u2013310. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48797-6_13"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11761679_1","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"JH Cheon","year":"2006","unstructured":"Cheon, J.H.: Security analysis of the strong Diffie-Hellman problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 1\u201311. Springer, Heidelberg (2006). doi: 10.1007\/11761679_1"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-40041-4_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J-S Coron","year":"2013","unstructured":"Coron, J.-S., Lepoint, T., Tibouchi, M.: Practical multilinear maps over the integers. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 476\u2013493. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40041-4_26"},{"key":"5_CR18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1112\/S0010437X10005075","volume":"147","author":"C Diem","year":"2011","unstructured":"Diem, C.: On the discrete logarithm problem in elliptic curves. Compositio Math. 147, 75\u2013104 (2011)","journal-title":"Compositio Math."},{"key":"5_CR19","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.2140\/ant.2013.7.1281","volume":"7","author":"C Diem","year":"2013","unstructured":"Diem, C.: On the discrete logarithm problem in elliptic curves II. Algebra Number Theory 7, 1281\u20131323 (2013)","journal-title":"Algebra Number Theory"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, S., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), pp. 40\u201349 (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"5_CR21","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s00145-001-0011-x","volume":"15","author":"P Gaudry","year":"2002","unstructured":"Gaudry, P., Hess, F., Smart, N.: Constructive and destructive facets of Weil descent on elliptic curves. J. Cryptol. 15, 19\u201334 (2002)","journal-title":"J. Cryptol."},{"key":"5_CR22","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1137\/0406010","volume":"6","author":"D Gordon","year":"1993","unstructured":"Gordon, D.: Discrete logarithms in $$GF(p)$$ using the number field sieve. SIAM J. Discrete Math. 6, 124\u2013138 (1993)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-662-48797-6_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"A Guillevic","year":"2015","unstructured":"Guillevic, A.: Computing individual discrete logarithms faster in $$GF(p^n)$$ with the NFS-DL algorithm. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 149\u2013173. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48797-6_7"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-03298-1_1","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"D Jao","year":"2009","unstructured":"Jao, D., Yoshida, K.: Boneh-Boyen signatures and the strong Diffie-Hellman problem. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 1\u201316. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03298-1_1"},{"key":"5_CR25","unstructured":"Jeong, J., Kim, T.: Extended tower number field sieve with application to finite fields of arbitrary composite extension degree. Cryptology ePrint Archive: Report 2016\/526 (2016)"},{"key":"5_CR26","doi-asserted-by":"crossref","DOI":"10.1201\/9781420070033","volume-title":"Algorithmic Cryptanalysis","author":"A Joux","year":"2009","unstructured":"Joux, A.: Algorithmic Cryptanalysis. Chapman & Hall\/CRC, Boca Raton (2009)"},{"key":"5_CR27","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1090\/S0025-5718-02-01482-5","volume":"72","author":"A Joux","year":"2003","unstructured":"Joux, A., Lercier, R.: Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the Gaussian integer method. Math. Comput. 72, 953\u2013967 (2003)","journal-title":"Math. Comput."},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/11818175_19","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"A Joux","year":"2006","unstructured":"Joux, A., Lercier, R., Smart, N., Vercauteren, F.: The number field sieve in the medium prime case. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 326\u2013344. Springer, Heidelberg (2006). doi: 10.1007\/11818175_19"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-04873-4_3","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2013","author":"A Joux","year":"2014","unstructured":"Joux, A., Pierrot, C.: The special number field sieve in $$\\mathbb{F}_{p^{n}}$$ \u2013 application to pairing-friendly construction. In: Cao, Z., Zhang, F. (eds.) Pairing 2013. LNCS, vol. 8365, pp. 45\u201361. Springer, Cham (2014). doi: 10.1007\/978-3-319-04873-4_3"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-85538-5_9","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"EJ Kachisa","year":"2008","unstructured":"Kachisa, E.J., Schaefer, E.F., Scott, M.: Constructing Brezing-Weng pairing-friendly elliptic curves using elements in the cyclotomic field. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 126\u2013135. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-85538-5_9"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-662-53018-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"T Kim","year":"2016","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: a new complexity for the medium prime case. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 543\u2013571. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-53018-4_20"},{"key":"5_CR32","first-page":"357","volume":"57","author":"N Koblitz","year":"2010","unstructured":"Koblitz, N., Menezes, A.: The brave new world of bodacious assumptions in cryptography. Not. AMS 57, 357\u2013365 (2010)","journal-title":"Not. AMS"},{"key":"5_CR33","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BFb0091537","volume-title":"The Development of the Number Field Sieve","author":"AK Lenstra","year":"1993","unstructured":"Lenstra, A.K., Lenstra, H.W., Manasse, M.S., Pollard, J.M.: The number field sieve. In: Lenstra, A.K., Lenstra, H.W. (eds.) The Development of the Number Field Sieve. LNM, vol. 1554, pp. 11\u201342. Springer, Heidelberg (1993). doi: 10.1007\/BFb0091537"},{"key":"5_CR34","unstructured":"Mayo, K.: A primer on cryptographic multilinear maps and code obfuscation. M.Math. thesis, University of Waterloo (2015). http:\/\/hdl.handle.net\/10012\/9698"},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-662-46800-5_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"C Pierrot","year":"2015","unstructured":"Pierrot, C.: The multiple number field sieve with conjugation and generalized Joux-Lercier methods. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 156\u2013170. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46800-5_7"},{"key":"5_CR36","first-page":"918","volume":"32","author":"J Pollard","year":"1978","unstructured":"Pollard, J.: Monte Carlo methods for index computation mod $$p$$ . Math. Comput. 32, 918\u2013924 (1978)","journal-title":"Math. Comput."},{"key":"5_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-662-49890-3_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"P Sarkar","year":"2016","unstructured":"Sarkar, P., Singh, S.: New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 429\u2013458. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49890-3_17"},{"key":"5_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-662-53887-6_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"P Sarkar","year":"2016","unstructured":"Sarkar, P., Singh, S.: A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 37\u201362. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-53887-6_2"},{"key":"5_CR39","unstructured":"Sarkar, P., Singh, S.: A generalisation of the conjugation method for polynomial selection for the extended tower number field sieve algorithm. IACR Cryptology ePrint Archive: Report 2016\/537 (2016)"},{"key":"5_CR40","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1090\/S0025-5718-99-01137-0","volume":"69","author":"O Schirokauer","year":"2000","unstructured":"Schirokauer, O.: Using number fields to compute logarithms in finite fields. Math. Comput. 69, 1267\u20131283 (2000)","journal-title":"Math. Comput."},{"key":"5_CR41","unstructured":"Smart, N. (ed.): ECRYPT II Yearly Report on Algorithms and Keysizes (2011\u20132012), 30 September 2012"}],"container-title":["Lecture Notes in Computer Science","Paradigms in Cryptology \u2013 Mycrypt 2016. Malicious and Exploratory Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61273-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T00:57:59Z","timestamp":1569805079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-61273-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319612720","9783319612737"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61273-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}