{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:31:15Z","timestamp":1773235875468,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T00:00:00Z","timestamp":1379548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s00145-013-9158-5","type":"journal-article","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T15:51:23Z","timestamp":1379519483000},"page":"595-635","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm"],"prefix":"10.1007","volume":"27","author":[{"given":"Jean-Charles","family":"Faug\u00e8re","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierrick","family":"Gaudry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louise","family":"Huot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gu\u00e9na\u00ebl","family":"Renault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,19]]},"reference":[{"key":"9158_CR1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-48329-2_13","volume-title":"Advances in Cryptology\u2014CRYPTO\u201993","author":"L. Adleman","year":"1994","unstructured":"L. Adleman, J. DeMarrais, A subexponential algorithm for discrete logarithms over all finite fields, in Advances in Cryptology\u2014CRYPTO\u201993 (Springer, Berlin, 1994), pp. 147\u2013158"},{"key":"9158_CR2","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58691-1","volume-title":"Algorithmic Number Theory","author":"L. Adleman","year":"1994","unstructured":"L. Adleman, J. DeMarrais, M.-D. Huang, A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyper-elliptic curves over finite fields, in Algorithmic Number Theory. Lecture Notes in Comput. Sci., vol.\u00a0877 (Springer, Berlin, 1994). 6th International Symposium"},{"key":"9158_CR3","first-page":"71","volume-title":"International Conference on Polynomial System Solving\u2014ICPSS","author":"M. Bardet","year":"2004","unstructured":"M. Bardet, J.-C. Faug\u00e8re, B. Salvy, On the complexity of gr\u00f6bner basis computation of semi-regular overdetermined algebraic equations, in International Conference on Polynomial System Solving\u2014ICPSS, (2004), pp. 71\u201375"},{"key":"9158_CR4","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-68164-9_26","volume-title":"Proceedings of the Cryptology in Africa 1st International Conference on Progress in Cryptology, AFRICACRYPT\u201908","author":"D. Bernstein","year":"2008","unstructured":"D. Bernstein, P. Birkner, M. Joye, T. Lange, C. Peters, Twisted Edwards curves, in Proceedings of the Cryptology in Africa 1st International Conference on Progress in Cryptology, AFRICACRYPT\u201908 (Springer, Berlin, 2008), pp. 389\u2013405"},{"key":"9158_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-3-540-76900-2_3","volume-title":"Advances in Cryptology: ASIACRYPT 2007","author":"D.J. Bernstein","year":"2007","unstructured":"D.J. Bernstein, T. Lange, Faster addition and doubling on elliptic curves, in Advances in Cryptology: ASIACRYPT 2007. Lecture Notes in Computer Science, vol.\u00a04833 (Springer, Berlin, 2007), pp. 29\u201350"},{"issue":"3","key":"9158_CR6","first-page":"177","volume":"3(issue","author":"L. Bettale","year":"2009","unstructured":"L. Bettale, J.-C. Faug\u00e8re, L. Perret, Hybrid approach for solving multivariate systems over finite fields. J. Math. Cryptol.\n                  3(issue(3), 177\u2013197 (2009)","journal-title":"J. Math. Cryptol."},{"issue":"3\u20134","key":"9158_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"W. Bosma, J. Cannon, C. Playoust, The Magma algebra system. I. The user language. J. Symb. Comput.\n                  24(3\u20134), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"9158_CR8","doi-asserted-by":"publisher","first-page":"778","DOI":"10.2307\/2372597","volume":"77","author":"C. Chevalley","year":"1955","unstructured":"C. Chevalley, Invariants of finite groups generated by reflections. Am. J. Math.\n                  77(4), 778\u2013782 (1955)","journal-title":"Am. J. Math."},{"issue":"4","key":"9158_CR9","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-8858(86)90023-0","volume":"7","author":"D. Chudnovsky","year":"1986","unstructured":"D. Chudnovsky, G. Chudnovsky, Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Adv. Appl. Math.\n                  7(4), 385\u2013434 (1986)","journal-title":"Adv. Appl. Math."},{"key":"9158_CR10","series-title":"Algorithms and Computation in Mathematics Series","volume-title":"Some Tapas of Computer Algebra","author":"A. Cohen","year":"2011","unstructured":"A. Cohen, H. Cuypers, H. Sterk, Some Tapas of Computer Algebra. Algorithms and Computation in Mathematics Series (Springer, Berlin, 2011)"},{"key":"9158_CR11","first-page":"17","volume-title":"Public-Key Cryptography and Computational Number Theory","author":"J.-M. Couveignes","year":"2001","unstructured":"J.-M. Couveignes, Algebraic groups and discrete logarithm, in Public-Key Cryptography and Computational Number Theory, (2001), pp. 17\u201327"},{"key":"9158_CR12","first-page":"142","volume-title":"Series on Number Theory and Its Applications","author":"J.-M. Couveignes","year":"2008","unstructured":"J.-M. Couveignes, R. Lercier, Galois invariant smoothness basis, in Series on Number Theory and Its Applications, vol.\u00a05 (World Scientific, Singapore, 2008), pp. 142\u2013167"},{"key":"9158_CR13","series-title":"Undergraduate Texts in Mathematics","volume-title":"Ideals, Varieties, and Algorithms\u2014An Introduction to Computational Algebraic Geometry and Commutative Algebra","author":"D.A. Cox","year":"1997","unstructured":"D.A. Cox, J. Little, D. O\u2019Shea, Ideals, Varieties, and Algorithms\u2014An Introduction to Computational Algebraic Geometry and Commutative Algebra, 2nd edn. Undergraduate Texts in Mathematics (Springer, Berlin, 1997)","edition":"2"},{"key":"9158_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/11792086_38","volume-title":"Algorithmic Number Theory ANTS-VII","author":"C. Diem","year":"2006","unstructured":"C. Diem, An index calculus algorithm for plane curves of small degree, in Algorithmic Number Theory ANTS-VII. Lecture Notes in Computer Science, vol.\u00a04076 (Springer, Berlin, 2006), pp. 543\u2013557"},{"key":"9158_CR15","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1090\/S0025-5718-2010-02281-1","volume":"80","author":"C. Diem","year":"2011","unstructured":"C. Diem, On the discrete logarithm problem in class groups of curves. Math. Comput.\n                  80, 443\u2013475 (2011)","journal-title":"Math. Comput."},{"key":"9158_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1112\/S0010437X10005075","volume":"147","author":"C. Diem","year":"2011","unstructured":"C. Diem, On the discrete logarithm problem in elliptic curves. Compos. Math.\n                  147, 75\u2013104 (2011)","journal-title":"Compos. Math."},{"issue":"4","key":"9158_CR17","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00145-007-9014-6","volume":"21","author":"C. Diem","year":"2008","unstructured":"C. Diem, E. Thom\u00e9, Index calculus in class groups of non-hyperelliptic curves of genus three. J. Cryptol.\n                  21(4), 593\u2013611 (2008)","journal-title":"J. Cryptol."},{"key":"9158_CR18","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1090\/S0273-0979-07-01153-6","volume":"44","author":"H. Edwards","year":"2007","unstructured":"H. Edwards, A normal form for elliptic curves. Bull. Am. Math. Soc.\n                  44, 393\u2013422 (2007)","journal-title":"Bull. Am. Math. Soc."},{"issue":"1","key":"9158_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.4064\/aa102-1-6","volume":"102","author":"A. Enge","year":"2002","unstructured":"A. Enge, P. Gaudry, A general framework for subexponential discrete logarithm algorithms. Acta Arith.\n                  102(1), 83\u2013103 (2002)","journal-title":"Acta Arith."},{"key":"9158_CR20","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-72540-4_22","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2007","author":"A. Enge","year":"2007","unstructured":"A. Enge, P. Gaudry, An l(1\/3+\u03b5) algorithm for the discrete logarithm problem for low degree curves, in Advances in Cryptology\u2014EUROCRYPT 2007 (Springer, Berlin, 2007), pp. 379\u2013393"},{"issue":"1\u20133","key":"9158_CR21","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J.-C. Faug\u00e8re","year":"1999","unstructured":"J.-C. Faug\u00e8re, A new efficient algorithm for computing Gr\u00f6bner bases (F4). J. Pure Appl. Algebra\n                  139(1\u20133), 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"9158_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/780506.780516","volume-title":"Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC\u201902","author":"J.-C. Faug\u00e8re","year":"2002","unstructured":"J.-C. Faug\u00e8re, A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5), in Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC\u201902 (ACM, New York, 2002), pp. 75\u201383"},{"key":"9158_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-15582-6_17","volume-title":"Mathematical Software\u2014ICMS 2010","author":"J.-C. Faug\u00e8re","year":"2010","unstructured":"J.-C. Faug\u00e8re, FGb: a library for computing Gr\u00f6bner bases, in Mathematical Software\u2014ICMS 2010, ed. by K. Fukuda, J. Hoeven, M. Joswig, N. Takayama. Lecture Notes in Computer Science, vol.\u00a06327 (Springer, Berlin, 2010), pp. 84\u201387"},{"key":"9158_CR24","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2429135.2429149","volume":"46","author":"J.-C. Faug\u00e8re","year":"2012","unstructured":"J.-C. Faug\u00e8re, P. Gaudry, L. Huot, G. Renault, Fast change of ordering with exponent \u03c9. ACM Commun. Comput. Algebr.\n                  46, 92\u201393 (2012)","journal-title":"ACM Commun. Comput. Algebr."},{"issue":"4","key":"9158_CR25","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J.-C. Faug\u00e8re","year":"1993","unstructured":"J.-C. Faug\u00e8re, P. Gianni, D. Lazard, T. Mora, Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering. J. Symb. Comput.\n                  16(4), 329\u2013344 (1993)","journal-title":"J. Symb. Comput."},{"key":"9158_CR26","first-page":"1","volume-title":"Proceedings of the 2011 International Symposium on Symbolic and Algebraic Computation, ISSAC\u201911","author":"J.-C. Faug\u00e8re","year":"2011","unstructured":"J.-C. Faug\u00e8re, C. Mou, Fast algorithm for change of ordering of zero-dimensional Gr\u00f6bner bases with sparse multiplication matrices, in Proceedings of the 2011 International Symposium on Symbolic and Algebraic Computation, ISSAC\u201911 (ACM, New York, 2011), pp. 1\u20138"},{"key":"9158_CR27","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/1576702.1576725","volume-title":"Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, ISSAC\u201909","author":"J.-C. Faug\u00e8re","year":"2009","unstructured":"J.-C. Faug\u00e8re, S. Rahmany, Solving systems of polynomial equations with symmetries using SAGBI-Gr\u00f6bner bases, in Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, ISSAC\u201909 (ACM, New York, 2009), pp. 151\u2013158"},{"key":"9158_CR28","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/2465506.2465943","volume-title":"Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, ISSAC\u201913","author":"J.-C. Faug\u00e8re","year":"2013","unstructured":"J.-C. Faug\u00e8re, M. Safey El Din, T. Verron, On the complexity of computing Gr\u00f6bner bases for quasi-homogeneous systems, in Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, ISSAC\u201913 (ACM, New York, 2013), pp. 189\u2013196"},{"key":"9158_CR29","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-13562-0_19","volume-title":"Theory and Applications of Models of Computation","author":"R. Feng","year":"2010","unstructured":"R. Feng, M. Nie, H. Wu, Twisted Jacobi intersections curves, in Theory and Applications of Models of Computation, (2010), pp. 199\u2013210"},{"key":"9158_CR30","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-56755-1_13","volume-title":"International Conference on Finite Fields and Applications","author":"G. Frey","year":"2001","unstructured":"G. Frey, Applications of arithmetical geometry to cryptographic constructions, in International Conference on Finite Fields and Applications, (2001), pp. 128\u2013161"},{"issue":"12","key":"9158_CR31","doi-asserted-by":"publisher","first-page":"1690","DOI":"10.1016\/j.jsc.2008.08.005","volume":"44","author":"P. Gaudry","year":"2009","unstructured":"P. Gaudry, Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem. J. Symb. Comput.\n                  44(12), 1690\u20131702 (2009)","journal-title":"J. Symb. Comput."},{"key":"9158_CR32","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1090\/S0025-5718-06-01900-4","volume":"76","author":"P. Gaudry","year":"2007","unstructured":"P. Gaudry, E. Thom\u00e9, N. Th\u00e9riault, C. Diem, A double large prime variation for small genus hyperelliptic index calculus. Math. Comput.\n                  76, 475\u2013492 (2007)","journal-title":"Math. Comput."},{"key":"9158_CR33","unstructured":"F. Hess, Computing relations in divisor class groups of algebraic curves over finite fields (2004). Preprint"},{"issue":"1","key":"9158_CR34","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00145-011-9116-z","volume":"26","author":"A. Joux","year":"2013","unstructured":"A. Joux, V. Vitse, Elliptic curve discrete logarithm problem over small degree extension fields. J. Cryptol.\n                  26(1), 119\u2013143 (2013)","journal-title":"J. Cryptol."},{"key":"9158_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3542-0","volume-title":"Reflection Groups and Invariant Theory","author":"R. Kane","year":"2001","unstructured":"R. Kane, Reflection Groups and Invariant Theory (Springer, Berlin, 2001)"},{"issue":"177","key":"9158_CR36","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz, Elliptic curve cryptosystems. Math. Comput.\n                  48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"9158_CR37","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N. Koblitz","year":"1989","unstructured":"N. Koblitz, Hyperelliptic cryptosystems. J. Cryptol.\n                  1, 139\u2013150 (1989)","journal-title":"J. Cryptol."},{"key":"9158_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-12868-9_99","volume-title":"Computer Algebra","author":"D. Lazard","year":"1983","unstructured":"D. Lazard, Gr\u00f6bner bases, Gaussian elimination and resolution of systems of algebraic equations, in Computer Algebra, ed. by J. van Hulzen. Lecture Notes in Computer Science, vol.\u00a0162 (Springer, Berlin, 1983), pp. 146\u2013156"},{"key":"9158_CR39","series-title":"Lecture Notes in Computer Sciences","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology\u2014CRYPTO 85","author":"V. Miller","year":"1986","unstructured":"V. Miller, Use of elliptic curves in cryptography, in Advances in Cryptology\u2014CRYPTO 85. Lecture Notes in Computer Sciences, vol.\u00a0218 (Springer, New York, 1986), pp. 417\u2013426"},{"issue":"177","key":"9158_CR40","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"P. Montgomery","year":"1987","unstructured":"P. Montgomery, Speeding the Pollard and elliptic curve methods of factorization. Math. Comput.\n                  48(177), 243\u2013264 (1987)","journal-title":"Math. Comput."},{"key":"9158_CR41","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14518-6_23","volume-title":"Algorithmic Number Theory","author":"K. Nagao","year":"2010","unstructured":"K. Nagao, Decomposed attack for the Jacobian of a hyperelliptic curve over an extension field, in Algorithmic Number Theory, ed. by G. Hanrot, F. Morain, E. Thom\u00e9. Lecture Notes in Comput. Sci., vol.\u00a06197 (Springer, Berlin, 2010). Proceedings of the 9th International Symposium, Nancy, France, ANTS-IX, July 19\u201323, 2010"},{"key":"9158_CR42","unstructured":"N.I. of, Standards and technology. Digital signature standard (dss). Technical Report FIPS PUB 186-3, US Department of Commerce (2009)"},{"issue":"143","key":"9158_CR43","first-page":"918","volume":"32","author":"J. Pollard","year":"1978","unstructured":"J. Pollard, Monte Carlo methods for index computation mod p. Math. Comput.\n                  32(143), 918\u2013924 (1978)","journal-title":"Math. Comput."},{"key":"9158_CR44","unstructured":"I. Semaev, Summation polynomials and the discrete logarithm problem on elliptic curves. Cryptology ePrint archive, report 2004\/031 (2004). \n                    http:\/\/eprint.iacr.org\/"},{"key":"9158_CR45","doi-asserted-by":"publisher","first-page":"274","DOI":"10.4153\/CJM-1954-028-3","volume":"6","author":"G.C. Shephard","year":"1954","unstructured":"G.C. Shephard, J.A. Todd, Finite unitary reflection groups. Can. J. Math.\n                  6, 274\u2013304 (1954)","journal-title":"Can. J. Math."},{"key":"9158_CR46","first-page":"256","volume-title":"Proceedings of the 16th Annual International Conference on Theory and Application of Cryptographic Techniques","author":"V. Shoup","year":"1997","unstructured":"V. Shoup, Lower bounds for discrete logarithms and related problems, in Proceedings of the 16th Annual International Conference on Theory and Application of Cryptographic Techniques (Springer, Berlin, 1997), pp. 256\u2013266"},{"key":"9158_CR47","volume-title":"Algorithms in Invariant Theory (Texts and Monographs in Symbolic Computation)","author":"B. Sturmfels","year":"2008","unstructured":"B. Sturmfels, Algorithms in Invariant Theory (Texts and Monographs in Symbolic Computation), 2nd edn. (Springer, Berlin, 2008)","edition":"2"},{"key":"9158_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-3-540-40061-5_5","volume-title":"Advances in Cryptology: ASIACRYPT 2003","author":"N. Th\u00e9riault","year":"2003","unstructured":"N. Th\u00e9riault, Index calculus attack for hyperelliptic curves of small genus, in Advances in Cryptology: ASIACRYPT 2003. Lecture Notes in Computer Science, vol.\u00a02894, (2003), pp. 75\u201392"},{"key":"9158_CR49","volume-title":"Modern Computer Algebra","author":"J. Gathen von zur","year":"2002","unstructured":"J. von zur Gathen, J. Gerhard, Modern Computer Algebra (Cambridge University Press, Cambridge, 2002)"},{"issue":"1","key":"9158_CR50","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"D. Wiedemann","year":"1986","unstructured":"D. Wiedemann, Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theory\n                  32(1), 54\u201362 (1986)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9158-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-013-9158-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9158-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9158-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:12:03Z","timestamp":1586333523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-013-9158-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,19]]},"references-count":50,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9158"],"URL":"https:\/\/doi.org\/10.1007\/s00145-013-9158-5","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,19]]},"assertion":[{"value":"12 April 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2013","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}