{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:01:28Z","timestamp":1760061688630},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319724522"},{"type":"electronic","value":"9783319724539"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72453-9_11","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T04:35:54Z","timestamp":1513744554000},"page":"147-162","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Integrating Algebraic and SAT Solvers"],"prefix":"10.1007","author":[{"given":"Jan","family":"Hor\u00e1\u010dek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Burchard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Becker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kreuzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"11_CR1","unstructured":"Bard, G., Courtois, N., Jefferson, C.: Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over GF(2) via SAT-solvers. In: IACR Cryptology ePrint Archive (2007). https:\/\/eprint.iacr.org\/2007\/024.pdf"},{"key":"11_CR2","unstructured":"Bebel, J., Yuen, H.: Hard SAT instances based on factoring. In: SAT Competition 2013: Solver and Benchmark Descriptions, University of Helsinki, p. 102 (2013)"},{"key":"11_CR3","volume-title":"Boolean Gr\u00f6bner Bases: Theory, Algorithms and Applications","author":"M Brickenstein","year":"2010","unstructured":"Brickenstein, M.: Boolean Gr\u00f6bner Bases: Theory, Algorithms and Applications. Logos Verlag, Berlin (2010)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Burchard, J., Gay, M., Messeng Ekossono, A.S., Hor\u00e1\u010dek, J., Becker, B., Schubert, T., Kreuzer, M., Polian, I.: AutoFault: towards automatic construction of algebraic fault attacks. In: Proceedings of Conference on Fault Diagnosis and Tolarence in Cryptography (FDTC 2017), Taipei (2017, to appear)","DOI":"10.1109\/FDTC.2017.13"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Burchard, J., Messeng Ekosonno, A.-S., Hor\u00e1\u010dek, J., Gay, M., Becker, B., Schubert, T., Kreuzer, M., Polian, I.: Towards mixed structural-functional models for algebraic fault attacks on ciphers. In: Proceedings of International Verification and Security Workshop (IVSW 2017) (2017)","DOI":"10.1109\/IVSW.2017.8031537"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-540-71209-1_48","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Condrat","year":"2007","unstructured":"Condrat, C., Kalla, P.: A Gr\u00f6bner basis approach to CNF-formulae preprocessing. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 618\u2013631. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71209-1_48"},{"key":"11_CR7","unstructured":"Dreyer, A., Nguyen, T.H.: Improving Gr\u00f6bner-based clause learning for SAT solving industrial sized Boolean problems. In: Young Researcher Symposium (YRS) (Kaiserslautern 2013), Fraunhofer ITWM, pp. 72\u201377 (2013)"},{"key":"11_CR8","unstructured":"Gay, M., Burchard, J., Hor\u00e1\u010dek, J., Messeng Ekossono, A.S., Schubert, T., Becker, B., Kreuzer, M., Polian, I.: Small scale AES toolbox: algebraic and propositional formulas, circuit-implementations and fault equations. In: Conference on Trustworthy Manufacturing and Utilization of Secure Devices (TRUDEVICE 2016), Barcelona (2016)"},{"key":"11_CR9","unstructured":"Gaztanaga, I.: The Boost Interprocess Library, version 1.63.0. www.boost.org\/doc\/libs\/1_63_0\/doc\/html\/interprocess.html"},{"key":"11_CR10","unstructured":"Hor\u00e1\u010dek, J., Kreuzer, M.: On conversions from CNF to ANF. In: 2th International Workshop on Satisfiability Checking and Symbolic Computation, SC-square, Kaiserslautern (2017)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Hor\u00e1\u010dek, J., Kreuzer, M., Messeng Ekossono, A.S.: Computing Boolean border bases. In: Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2016), Timisoara, pp. 465\u2013472. IEEE (2016)","DOI":"10.1109\/SYNASC.2016.076"},{"key":"11_CR12","unstructured":"Hor\u00e1\u010dek, J., Kreuzer, M., Messeng Ekossono, A.S.: A signature based border basis algorithm. In: Conference on Algebraic Informatics, CAI, Kalamata (2017)"},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1515\/gcc.2010.016","volume":"2","author":"P Jovanovic","year":"2010","unstructured":"Jovanovic, P., Kreuzer, M.: Algebraic attacks using SAT-solvers. Groups Complex. Cryptol. 2, 247\u2013259 (2010)","journal-title":"Groups Complex. Cryptol."},{"issue":"2","key":"11_CR14","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.jpaa.2005.07.006","volume":"205","author":"A Kehrein","year":"2006","unstructured":"Kehrein, A., Kreuzer, M.: Computing border bases. J. Pure Appl. Algebra 205(2), 279\u2013295 (2006)","journal-title":"J. Pure Appl. Algebra"},{"key":"11_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-70628-1","volume-title":"Computational Commutative Algebra 1","author":"M Kreuzer","year":"2000","unstructured":"Kreuzer, M., Robbiano, L.: Computational Commutative Algebra 1. Springer, Heidelberg (2000)"},{"key":"11_CR16","unstructured":"Schubert, T., Reimer, S.: Antom (2016). https:\/\/projects.informatik.uni-freiburg.de\/projects\/antom"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-15274-0_26","volume-title":"Computer Algebra in Scientific Computing","author":"C Zengler","year":"2010","unstructured":"Zengler, C., K\u00fcchlin, W.: Extending clause learning of SAT solvers with boolean Gr\u00f6bner bases. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2010. LNCS, vol. 6244, pp. 293\u2013302. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15274-0_26"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72453-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T04:55:54Z","timestamp":1570510554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72453-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319724522","9783319724539"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72453-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}