{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T17:41:26Z","timestamp":1749318086664,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1109\/date.2012.6176625","type":"proceedings-article","created":{"date-parts":[[2013,2,19]],"date-time":"2013-02-19T13:16:29Z","timestamp":1361279789000},"page":"899-904","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Gröbner basis reductions for formal verification of galois field multipliers"],"prefix":"10.1109","author":[{"family":"Jinpeng Lv","sequence":"first","affiliation":[]},{"given":"P.","family":"Kalla","sequence":"additional","affiliation":[]},{"given":"F.","family":"Enescu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/HLDVT.2011.6113989"},{"journal-title":"An Introduction to Grobner Bases","year":"1994","author":"adams","key":"22"},{"key":"17","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/3-540-44585-4_45","article-title":"Towards efficient verification of arithmetic algorithms over Galois fields GF(2m)","volume":"2102","author":"morioka","year":"2001","journal-title":"Proc Computer- Aided Verification"},{"key":"23","article-title":"A criterion for detecting unnecessary reductions in the construction of a groebner bases","author":"buchberger","year":"1979","journal-title":"EUROSAM"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.895755"},{"journal-title":"SINGULAR 3-1-3 - A Computer Algebra System for Polynomial Computations","year":"2011","author":"decker","key":"24"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2005.1560081"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.888277"},{"key":"13","article-title":"Modd for CF: A Compact Representation for Multiple Output Function","author":"rajaprabhu","year":"0","journal-title":"IEEE International High Level Design Validation and Test Works Hop 2004"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2059271"},{"key":"11","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/196244.196444","article-title":"efficient representation and manipulation of switching functions based on ordered kronecker functional decision diagrams","author":"drechsler","year":"1994","journal-title":"31st Design Automation Conference"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/217474.217583"},{"key":"21","article-title":"STABLE: A new QBF-BV SMT Solver for hard Verification Problems combining Boolean Reasoning with Computer Algebra","author":"pavlenko","year":"0","journal-title":"Proc Design Auto & Test in Europe (DATE) 2011"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1004591"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/VLSID.2012.102"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008208521515"},{"key":"1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/3-540-51083-4_67","article-title":"VLSI Designs for Multiplication over Finite Fields GF(2m)","volume":"357","author":"mastrovito","year":"1989","journal-title":"Lecture Notes in Computer Science"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"journal-title":"Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal","year":"1965","author":"buchberger","key":"7"},{"journal-title":"Counting Zeros over Finite Fields with Gro?bner Bases","year":"2009","author":"gao","key":"6"},{"key":"5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/978-3-540-85174-5_13","article-title":"Bug Attacks","author":"biham","year":"2008","journal-title":"Crypto 2008"},{"journal-title":"Modular Arithmetic Decision Procedure","year":"2005","author":"babic","key":"4"},{"key":"9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1983-2","author":"mceliece","year":"1987","journal-title":"Finite Fields for Computer Scientists and Engineers"},{"key":"8","article-title":"An Algebraic Approach to Proving Data Correctness in Arithmetic Datapaths","author":"wienand","year":"0","journal-title":"Intl Conf on Computer-Aided Verification 2008"}],"event":{"name":"2012 Design, Automation & Test in Europe Conference & Exhibition (DATE 2012)","start":{"date-parts":[[2012,3,12]]},"location":"Dresden","end":{"date-parts":[[2012,3,16]]}},"container-title":["2012 Design, Automation & Test in Europe Conference & Exhibition (DATE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6171057\/6176405\/06176625.pdf?arnumber=6176625","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T03:48:06Z","timestamp":1498016886000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6176625\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/date.2012.6176625","relation":{},"subject":[],"published":{"date-parts":[[2012,3]]}}}