{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:14:08Z","timestamp":1725794048424},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662434130"},{"type":"electronic","value":"9783662434147"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43414-7_11","type":"book-chapter","created":{"date-parts":[[2014,5,20]],"date-time":"2014-05-20T14:57:06Z","timestamp":1400597826000},"page":"205-222","source":"Crossref","is-referenced-by-count":11,"title":["Fast Exhaustive Search for Quadratic Systems in $$\\mathbb {F}_{2}$$ on FPGAs"],"prefix":"10.1007","author":[{"given":"Charles","family":"Bouillaguet","sequence":"first","affiliation":[]},{"given":"Chen-Mou","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Tung","family":"Chou","sequence":"additional","affiliation":[]},{"given":"Ruben","family":"Niederhagen","sequence":"additional","affiliation":[]},{"given":"Bo-Yin","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,21]]},"reference":[{"key":"11_CR1","series-title":"LNCS","first-page":"203","volume-title":"CHES 2010","author":"C Bouillaguet","year":"2010","unstructured":"Bouillaguet, C., Chen, H.-C., Cheng, C.-M., Chou, T., Niederhagen, R., Shamir, A., Yang, B.-Y.: Fast exhaustive search for polynomial systems in \n                      \n                        \n                      \n                      $${\\mathbb{F}_2}$$\n                    . In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 203\u2013218. Springer, Heidelberg (2010). Extended Version: http:\/\/www.lifl.fr\/\n                      \n                        \n                      \n                      $$\\sim $$\n                    bouillag\/pub.html"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bouillaguet, C., Cheng, C.-M., Chou, T., Niederhagen, R., Yang, B.-Y.: Fast exhaustive search for quadratic systems in \n                      \n                        \n                      \n                      $$\\mathbb{F}_2$$\n                     on FPGAs. Extended Version. IACR Cryptology ePrint Archive, Report 2013\/436. \n                      http:\/\/eprint.iacr.org\/2013\/436\n                      \n                     (2013)","DOI":"10.1007\/978-3-662-43414-7_11"},{"key":"11_CR3","unstructured":"Bouillaguet, C., Fouque, P.-A., Joux, A., Treger, J.: A family of weak keys in HFE (and the corresponding practical key-recovery). IACR Cryptology ePrint Archive, Report 2009\/619. \n                      http:\/\/eprint.iacr.org\/2009\/619\n                      \n                     (2009)"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.jco.2012.07.001","volume":"29","author":"M Bardet","year":"2013","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B., Spaenlehauer, P.-J.: On the complexity of solving quadratic boolean systems. J. Complex. 29(1), 53\u201375 (2013)","journal-title":"J. Complex."},{"key":"11_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/11761679_8","volume-title":"EUROCRYPT 2006","author":"C Berbain","year":"2006","unstructured":"Berbain, C., Gilbert, H., Patarin, J.: QUAD: a practical stream cipher with provable security. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 109\u2013128. Springer, Heidelberg (2006)"},{"key":"11_CR6","series-title":"LNCS","first-page":"97","volume-title":"FSE 2008","author":"NT Courtois","year":"2008","unstructured":"Courtois, N.T., Bard, G.V., Wagner, D.: Algebraic and slide attacks on KeeLoq. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 97\u2013115. Springer, Heidelberg (2008)"},{"key":"11_CR7","unstructured":"Courtois, N., Goubin, L., Patarin, J.: SFLASH, A Fast Asymmetric Signature Scheme for Low-Cost Smartcards: Primitive Specification, Second Revised Version. \n                      https:\/\/www.cosic.esat.kuleuven.be\/nessie\/tweaks.html\n                      \n                     (2002)"},{"key":"11_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45539-6_27","volume-title":"EUROCRYPT 2000","author":"NT Courtois","year":"2000","unstructured":"Courtois, N.T., Klimov, A.B., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 392\u2013407. Springer, Heidelberg (2000)"},{"key":"11_CR9","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: International Symposium on Symbolic and Algebraic Computation \u2013 ISSAC 2002, July 2002, pp. 75\u201383. ACM Press (2002)","DOI":"10.1145\/780506.780516"},{"key":"11_CR10","series-title":"LNCS","first-page":"33","volume-title":"EUROCRYPT 1996","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)"},{"key":"11_CR11","series-title":"LNCS","first-page":"282","volume-title":"CT-RSA 2001","author":"J Patarin","year":"2001","unstructured":"Patarin, J., Courtois, N.T., Goubin, L.: QUARTZ, 128-bit long digital signatures. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 282\u2013297. Springer, Heidelberg (2001)"},{"key":"11_CR12","unstructured":"Spartan-6 FPGA Configurable Logic Block \u2014 User Guide. v1.1 UG384. Xilinx Inc., Feb. 2010"},{"key":"11_CR13","series-title":"LNCS","first-page":"401","volume-title":"ICICS 2004","author":"B-Y Yang","year":"2004","unstructured":"Yang, B.-Y., Chen, J.-M., Courtois, N.T.: On asymptotic security estimates in XL and Gr\u00f6bner bases-related algebraic cryptanalysis. In: L\u00f3pez, J., Qing, S., Okamoto, E. (eds.) ICICS 2004. LNCS, vol. 3269, pp. 401\u2013413. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography -- SAC 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43414-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:51:49Z","timestamp":1558907509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43414-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662434130","9783662434147"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43414-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}