{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T11:23:12Z","timestamp":1744024992775,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662464465"},{"type":"electronic","value":"9783662464472"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46447-2_9","type":"book-chapter","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T01:21:25Z","timestamp":1426468885000},"page":"194-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Algebraic Cryptanalysis of a Quantum Money Scheme The Noise-Free Case"],"prefix":"10.1007","author":[{"given":"Marta Conde","family":"Pena","sequence":"first","affiliation":[]},{"given":"Jean-Charles","family":"Faug\u00e8re","sequence":"additional","affiliation":[]},{"given":"Ludovic","family":"Perret","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,17]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Christiano, P.: Quantum money from hidden subspaces. In: Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19\u201322, pp. 41\u201360 (2012)","DOI":"10.1145\/2213977.2213983"},{"key":"9_CR2","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B.: On the Complexity of the F5 Gr\u00f6bner basis Algorithm. Journal of Symbolic Computation, 1\u201324"},{"key":"9_CR3","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B.: On the complexity of Gr\u00f6bner basis computation of semi-regular overdetermined algebraic equations. In: Proc. of International Conference on Polynomial System Solving (ICPSS), pp. 71\u201375 (2004)"},{"key":"9_CR4","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. In: Proc. of MEGA 2005, Eighth International Symposium on Effective Methods in Algebraic Geometry (2005)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bennett, C.H., Brassard, G., Breidbard, S., Wiesner, S.: Quantum cryptography, or unforgeable subway tokens. In: Proceedings of CRYPTO, pp. 267\u2013275 (1982)","DOI":"10.1007\/978-1-4757-0602-4_26"},{"issue":"3\u20134","key":"9_CR6","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.J., Playoust, C.: The Magma algebra system I: The user language. Journal of Symbolic Computation 24(3\u20134), 235\u2013265 (1997)","journal-title":"Journal of Symbolic Computation"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(87)90117-8","volume":"66","author":"RP Brent","year":"1987","unstructured":"Brent, R.P., McKay, B.D.: Determinants and rank of random matrices over \n                      \n                        \n                      \n                      $$\\mathbb{Z}_m$$\n                    . Discrete Math. 66, 35\u201350 (1987)","journal-title":"Discrete Math."},{"key":"9_CR8","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, University of Innsbruck (1965)"},{"issue":"3\u20134","key":"9_CR9","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.jsc.2005.09.007","volume":"41","author":"B Buchberger","year":"2006","unstructured":"Buchberger, B.: Bruno Buchberger\u2019s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. J. Symb. Comput. 41(3\u20134), 475\u2013511 (2006)","journal-title":"J. Symb. Comput."},{"issue":"3\u20134","key":"9_CR10","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.jsc.2005.09.008","volume":"41","author":"B Buchberger","year":"2006","unstructured":"Buchberger, B.: Comments on the translation of my phd thesis. J. Symb. Comput. 41(3\u20134), 471\u2013474 (2006)","journal-title":"J. Symb. Comput."},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-39200-9_21","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"N Courtois","year":"2003","unstructured":"Courtois, N., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 345\u2013359. Springer, Heidelberg (2003)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Farhi, E., Gosset, D., Hassidim, A., Lutomirski, A., Shor, P.W.: Quantum money from knots, pp. 276\u2013289 (2012)","DOI":"10.1145\/2090236.2090260"},{"key":"9_CR13","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":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases (\n                      \n                        \n                      \n                      $${F}_4$$\n                    ). Journal of Pure and Applied Algebra 139, 61\u201388 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (\n                      \n                        \n                      \n                      $${F}_5$$\n                    ). In: ACM Press (ed.) International Symposium on Symbolic and Algebraic Computation, ISAAC 2002, pp. 75\u201383 (2002)","DOI":"10.1145\/780506.780516"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-45146-4_3","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J-C Faug\u00e8re","year":"2003","unstructured":"Faug\u00e8re, J.-C., Joux, A.: Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gr\u00f6bner bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 44\u201360. Springer, Heidelberg (2003)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11761679_3","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J-C Faug\u00e8re","year":"2006","unstructured":"Faug\u00e8re, J.-C., Perret, L.: Polynomial equivalence problems: algorithmic and theoretical aspects. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 30\u201347. Springer, Heidelberg (2006)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Gavinsky, D.: Quantum money with classical verification, pp. 42\u201352 (2012)","DOI":"10.1109\/CCC.2012.10"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1090\/conm\/523\/10311","volume":"523","author":"M Mosca","year":"2010","unstructured":"Mosca, M., Stebila, D.: Quantum coins. Error-Correcting Codes, Finite Geometry and Cryptography 523, 35\u201347 (2010)","journal-title":"Error-Correcting Codes, Finite Geometry and Cryptography"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"J Patarin","year":"1996","unstructured":"Patarin, J.: Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33\u201348. Springer, Heidelberg (1996)"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. ACM SIGACT News 15(1), 78\u201388 (1983)","journal-title":"Conjugate coding. ACM SIGACT News"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography -- PKC 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46447-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T11:46:41Z","timestamp":1559130401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46447-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662464465","9783662464472"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46447-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}