{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:43:16Z","timestamp":1773348196474,"version":"3.50.1"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1109\/hldvt.2011.6113989","type":"proceedings-article","created":{"date-parts":[[2012,1,6]],"date-time":"2012-01-06T19:31:55Z","timestamp":1325878315000},"page":"136-143","source":"Crossref","is-referenced-by-count":7,"title":["Verification of composite Galois field multipliers over GF ((2<sup>m<\/sup>)<sup>n<\/sup>) using computer algebra techniques"],"prefix":"10.1109","author":[{"given":"Jinpeng","family":"Lv","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Priyank","family":"Kalla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Enescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","author":"buchberger","year":"1965","journal-title":"Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2011.5763035"},{"key":"18","author":"cox","year":"2007","journal-title":"Ideals Varieties and Algorithms An Introduction to Computational Algebraic Geometry and Commutative Algebra"},{"key":"15","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"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.906458"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2006.244150"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.888277"},{"key":"11","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)","author":"morioka","year":"2001","journal-title":"Lecture Notes in Computer Science"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2005.1560081"},{"key":"21","author":"dutertre","year":"2006","journal-title":"The Yices SMT Solver"},{"key":"20","author":"adams","year":"1994","journal-title":"An Introduction to Grobner Bases"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73368-3_34"},{"key":"23","article-title":"Z3: An Efficient SMT Solver","volume":"4963","author":"de moura","year":"2008","journal-title":"LNCS"},{"key":"24","article-title":"Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays","volume":"5505","author":"brummayer","year":"2009","journal-title":"LNCS"},{"key":"25","year":"0","journal-title":"Sonolar SMT-COMP2010"},{"key":"26","year":"0","journal-title":"SimplifyingSTP SMT-COMP2010"},{"key":"27","first-page":"668","article-title":"Beaver: Engineering an efficient smt solver for bit-vector arithmetic","author":"jha","year":"2009","journal-title":"Computer Aided Verification"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1244937"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/12.508323"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.895755"},{"key":"1","author":"paar","year":"1994","journal-title":"Efficient Vlsi Architecture for Bit-parallel Computation in Galois Fields"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"6","author":"mastrovito","year":"1991","journal-title":"VLSI architectures for computation in Galois fields"},{"key":"5","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":"4","author":"decker","year":"2011","journal-title":"SINGULAR 3-1-3 - A Computer Algebra System for Polynomial Computations"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1995.250005"},{"key":"8","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"}],"event":{"name":"2011 IEEE International High Level Design Validation and Test Workshop (HLDVT)","location":"Napa Valley, CA, USA","start":{"date-parts":[[2011,11,9]]},"end":{"date-parts":[[2011,11,11]]}},"container-title":["2011 IEEE International High Level Design Validation and Test Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6093762\/6113979\/06113989.pdf?arnumber=6113989","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T12:22:54Z","timestamp":1497961374000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6113989\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/hldvt.2011.6113989","relation":{},"subject":[],"published":{"date-parts":[[2011,11]]}}}