{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:27:50Z","timestamp":1775471270832,"version":"3.50.1"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319893389","type":"print"},{"value":"9783319893396","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89339-6_15","type":"book-chapter","created":{"date-parts":[[2018,4,4]],"date-time":"2018-04-04T21:32:30Z","timestamp":1522877550000},"page":"266-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Cryptanalysis of RSA Variants with\u00a0Modified Euler Quotient"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0777-4175","authenticated-orcid":false,"given":"Mengce","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Noboru","family":"Kunihiro","sequence":"additional","affiliation":[]},{"given":"Honggang","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,6]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-39059-3_7","volume-title":"Information Security and Privacy","author":"Y Aono","year":"2013","unstructured":"Aono, Y.: Minkowski sum based lattice construction for multivariate simultaneous Coppersmith\u2019s technique and applications to RSA. In: Boyd, C., Simpson, L. (eds.) ACISP 2013. LNCS, vol. 7959, pp. 88\u2013103. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39059-3_7"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-45146-4_2","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J Bl\u00f6mer","year":"2003","unstructured":"Bl\u00f6mer, J., May, A.: New partial key exposure attacks on RSA. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 27\u201343. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-540-45146-4_2"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48910-X_1","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"D Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key d less than N0.292. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 1\u201311. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48910-X_1"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-49649-1_3","volume-title":"Advances in Cryptology \u2014 ASIACRYPT\u201998","author":"D Boneh","year":"1998","unstructured":"Boneh, D., Durfee, G., Frankel, Y.: An attack on RSA given a small fraction of the private key bits. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 25\u201334. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/3-540-49649-1_3"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-319-40367-0_16","volume-title":"Information Security and Privacy","author":"M Bunder","year":"2016","unstructured":"Bunder, M., Nitaj, A., Susilo, W., Tonien, J.: A new attack on three variants of the RSA cryptosystem. In: Liu, J.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9723, pp. 258\u2013268. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-40367-0_16"},{"issue":"S3","key":"15_CR6","first-page":"45","volume":"11","author":"M Bunder","year":"2017","unstructured":"Bunder, M., Tonien, J.: New attack on the RSA cryptosystem based on continued fractions. Malays. J. Math. Sci. 11(S3), 45\u201357 (2017)","journal-title":"Malays. J. Math. Sci."},{"issue":"3","key":"15_CR7","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/j.ffa.2006.05.004","volume":"13","author":"G Castagnos","year":"2007","unstructured":"Castagnos, G.: An efficient probabilistic public-key cryptosystem over quadratic fields quotients. Finite Fields Appl. 13(3), 563\u2013576 (2007)","journal-title":"Finite Fields Appl."},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-68339-9_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"D Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a bivariate integer equation; factoring with high bits known. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 178\u2013189. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-68339-9_16"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-68339-9_14","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"D Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a univariate modular equation. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 155\u2013165. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-68339-9_14"},{"issue":"4","key":"15_CR10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptol. 10(4), 233\u2013260 (1997)","journal-title":"J. Cryptol."},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-540-24676-3_29","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"J-S Coron","year":"2004","unstructured":"Coron, J.-S.: Finding small roots of bivariate integer polynomial equations revisited. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 492\u2013505. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24676-3_29"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-74143-5_21","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"J-S Coron","year":"2007","unstructured":"Coron, J.-S.: Finding small roots of bivariate integer polynomial equations: a direct approach. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 379\u2013394. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74143-5_21"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Elkamchouchi, H., Elshenawy, K., Shaban, H.: Extended RSA cryptosystem and digital signature schemes in the domain of Gaussian integers. In: ICCS 2002, vol. 1, pp. 91\u201395. IEEE (2002)","DOI":"10.1109\/ICCS.2002.1182444"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/11426639_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M Ernst","year":"2005","unstructured":"Ernst, M., Jochemsz, E., May, A., de Weger, B.: Partial key exposure attacks on RSA up to full size exponents. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 371\u2013386. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11426639_22"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/0-387-34805-0_17","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"A Fiat","year":"1990","unstructured":"Fiat, A.: Batch RSA. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 175\u2013185. Springer, New York (1990). \nhttps:\/\/doi.org\/10.1007\/0-387-34805-0_17"},{"issue":"5","key":"15_CR16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/1506409.1506429","volume":"52","author":"JA Halderman","year":"2009","unstructured":"Halderman, J.A., Schoen, S.D., Heninger, N., Clarkson, W., Paul, W., Calandrino, J.A., Feldman, A.J., Appelbaum, J., Felten, E.W.: Lest we remember: cold-boot attacks on encryption keys. Commun. ACM 52(5), 91\u201398 (2009)","journal-title":"Commun. ACM"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-13013-7_4","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"M Herrmann","year":"2010","unstructured":"Herrmann, M., May, A.: Maximizing small root bounds by linearization and applications to small secret exponent RSA. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 53\u201369. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13013-7_4"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BFb0024458","volume-title":"Crytography and Coding","author":"N Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham, N.: Finding small roots of univariate modular equations revisited. In: Darnell, M. (ed.) Cryptography and Coding 1997. LNCS, vol. 1355, pp. 131\u2013142. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/BFb0024458"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-46701-7_14","volume-title":"Secure Networking \u2014 CQRE [Secure] \u2019 99","author":"N Howgrave-Graham","year":"1999","unstructured":"Howgrave-Graham, N., Seifert, J.-P.: Extending Wiener\u2019s attack in the presence of many decrypting exponents. CQRE 1999. LNCS, vol. 1740, pp. 153\u2013166. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-46701-7_14"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/11935230_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"E Jochemsz","year":"2006","unstructured":"Jochemsz, E., May, A.: A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 267\u2013282. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11935230_18"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-540-74143-5_22","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"E Jochemsz","year":"2007","unstructured":"Jochemsz, E., May, A.: A polynomial time attack on RSA with private CRT-exponents smaller than N0.073. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 395\u2013411. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74143-5_22"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201996","author":"PC Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104\u2013113. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-68697-5_9"},{"issue":"1","key":"15_CR23","first-page":"27","volume":"E78\u2013A","author":"H Kuwakado","year":"1995","unstructured":"Kuwakado, H., Koyama, K., Tsuruoka, Y.: New RSA-type scheme based on singular cubic curves $${y^2\\equiv x^3+bx^2}$$y2\u2261x3+bx2 (mod $${n}$$n). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E78\u2013A(1), 27\u201333 (1995)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"4","key":"15_CR24","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"15_CR25","series-title":"ISC","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-02295-1_10","volume-title":"The LLL Algorithm - Survey and Applications","author":"A May","year":"2010","unstructured":"May, A.: Using LLL-reduction for solving RSA and factorization problems. In: Nguyen, P.Q., Vall\u00e9e, B. (eds.) The LLL Algorithm - Survey and Applications. ISC, pp. 315\u2013348. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02295-1_10"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-319-26617-6_6","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2015","author":"L Peng","year":"2015","unstructured":"Peng, L., Hu, L., Lu, Y., Sarkar, S., Xu, J., Huang, Z.: Cryptanalysis of variants of RSA with multiple small secret exponents. In: Biryukov, A., Goyal, V. (eds.) INDOCRYPT 2015. LNCS, vol. 9462, pp. 105\u2013123. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-26617-6_6"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-319-54705-3_9","volume-title":"Information Security and Cryptology","author":"L Peng","year":"2017","unstructured":"Peng, L., Hu, L., Lu, Y., Wei, H.: An improved analysis on three variants of the RSA cryptosystem. In: Chen, K., Lin, D., Yung, M. (eds.) Inscrypt 2016. LNCS, vol. 10143, pp. 140\u2013149. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-54705-3_9"},{"issue":"21","key":"15_CR28","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"JJ Quisquater","year":"1982","unstructured":"Quisquater, J.J., Couvreur, C.: Fast decipherment algorithm for RSA public-key cryptosystem. Electron. Lett. 18(21), 905\u2013907 (1982)","journal-title":"Electron. Lett."},{"key":"15_CR29","first-page":"199","volume-title":"ACM CCS 2009","author":"T Ristenpart","year":"2009","unstructured":"Ristenpart, T., Tromer, E., Shacham, H., Savage, S.: Hey, you, get off of my cloud: exploring information leakage in third-party compute clouds. In: Al-Shaer, E., Jha, S., Keromytis, A.D. (eds.) ACM CCS 2009, pp. 199\u2013212. ACM Press, Chicago (2009)"},{"issue":"2","key":"15_CR30","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"2","key":"15_CR31","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10623-014-9928-6","volume":"73","author":"S Sarkar","year":"2014","unstructured":"Sarkar, S.: Small secret exponent attack on RSA variant with modulus $$N=p^r q$$N=prq. Des. Codes Cryptogr. 73(2), 383\u2013392 (2014)","journal-title":"Des. Codes Cryptogr."},{"key":"15_CR32","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.dam.2015.10.003","volume":"203","author":"S Sarkar","year":"2016","unstructured":"Sarkar, S.: Revisiting prime power RSA. Discrete Appl. Math. 203, 127\u2013133 (2016)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"15_CR33","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s10623-012-9675-5","volume":"66","author":"S Sarkar","year":"2013","unstructured":"Sarkar, S., Maitra, S.: Cryptanalytic results on \u2018Dual CRT\u2019 and \u2018Common Prime\u2019 RSA. Des. Codes Cryptogr. 66(1\u20133), 157\u2013174 (2013)","journal-title":"Des. Codes Cryptogr."},{"key":"15_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-13039-2_15","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2014","author":"S Sarkar","year":"2014","unstructured":"Sarkar, S., Venkateswarlu, A.: Partial key exposure attack on CRT-RSA. In: Meier, W., Mukhopadhyay, D. (eds.) INDOCRYPT 2014. LNCS, vol. 8885, pp. 255\u2013264. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-13039-2_15"},{"key":"15_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/BFb0055738","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"T Takagi","year":"1998","unstructured":"Takagi, T.: Fast RSA-type cryptosystem modulo pkq. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 318\u2013326. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/BFb0055738"},{"key":"15_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-319-08344-5_12","volume-title":"Information Security and Privacy","author":"A Takayasu","year":"2014","unstructured":"Takayasu, A., Kunihiro, N.: Cryptanalysis of RSA with multiple small secret exponents. In: Susilo, W., Mu, Y. (eds.) ACISP 2014. LNCS, vol. 8544, pp. 176\u2013191. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-08344-5_12"},{"key":"15_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-13051-4_21","volume-title":"Selected Areas in Cryptography \u2013 SAC 2014","author":"A Takayasu","year":"2014","unstructured":"Takayasu, A., Kunihiro, N.: Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound. In: Joux, A., Youssef, A. (eds.) SAC 2014. LNCS, vol. 8781, pp. 345\u2013362. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-13051-4_21"},{"key":"15_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-40367-0_15","volume-title":"Information Security and Privacy","author":"A Takayasu","year":"2016","unstructured":"Takayasu, A., Kunihiro, N.: Partial key exposure attacks on RSA with multiple exponent pairs. In: Liu, J.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9723, pp. 243\u2013257. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-40367-0_15"},{"key":"15_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-319-52153-4_4","volume-title":"Topics in Cryptology \u2013 CT-RSA 2017","author":"A Takayasu","year":"2017","unstructured":"Takayasu, A., Kunihiro, N.: A tool kit for partial key exposure attacks on RSA. In: Handschuh, H. (ed.) CT-RSA 2017. LNCS, vol. 10159, pp. 58\u201373. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-52153-4_4"},{"issue":"3","key":"15_CR40","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"MJ Wiener","year":"1990","unstructured":"Wiener, M.J.: Cryptanalysis of short RSA secret exponents. IEEE Trans. Inf. Theory 36(3), 553\u2013558 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"15_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11432-015-5409-4","volume":"58","author":"M Zheng","year":"2015","unstructured":"Zheng, M., Hu, H.: Cryptanalysis of prime power RSA with two private exponents. Sci. China Inf. Sci. 58(11), 1\u20138 (2015)","journal-title":"Sci. China Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89339-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,6]],"date-time":"2018-04-06T11:11:40Z","timestamp":1523013100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89339-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319893389","9783319893396"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89339-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}