{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T15:49:37Z","timestamp":1781279377247,"version":"3.54.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1320335"],"award-info":[{"award-number":["CCF-1320335"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1619370"],"award-info":[{"award-number":["CCF-1619370"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1109\/tcad.2018.2818726","type":"journal-article","created":{"date-parts":[[2018,3,23]],"date-time":"2018-03-23T18:17:46Z","timestamp":1521829066000},"page":"576-588","source":"Crossref","is-referenced-by-count":8,"title":["Boolean Gr\u00f6bner Basis Reductions on Finite Field Datapath Circuits Using the Unate Cube Set Algebra"],"prefix":"10.1109","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6115-7461","authenticated-orcid":false,"given":"Utkarsh","family":"Gupta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7412-5138","authenticated-orcid":false,"given":"Priyank","family":"Kalla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vikas","family":"Rao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196789"},{"key":"ref32","first-page":"201","article-title":"Improved algorithms for elliptic curve arithmetic in GF(\n$2^{n}$\n)","author":"l\u00f3pez","year":"1998","journal-title":"Proc Selected Areas of Cryptography 00"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-540-69499-1_7","article-title":"Modular reduction in GF(\n$2^{n}$\n) without pre-computational phase","author":"kne\u017eevi?","year":"2008","journal-title":"Proc Int Workshop Arithmetic Finite Fields"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1004591"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.29"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.micpro.2015.01.007","article-title":"Groebner basis based formal verification of large arithmetic circuits using Gaussian elimination and cone-based polynomial extraction","volume":"39","author":"farahmandi","year":"2015","journal-title":"Microprocess Microsyst"},{"key":"ref11","first-page":"1048","article-title":"Formal verification of integer multipliers by combining Gröbner basis with logic reduction","author":"sayed-ahmed","year":"2016","journal-title":"Proc Design and Test in Europe (DATE) Conf"},{"key":"ref12","first-page":"169","article-title":"Equivalence checking using Gröbner bases","author":"sayed-ahmed","year":"2016","journal-title":"Proc Formal Methods in Computer Aided Design (FMCAD)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.23919\/FMCAD.2017.8102237"},{"key":"ref14","first-page":"238","article-title":"Efficient parallel verification of Galois field multipliers","author":"yu","year":"2017","journal-title":"Proc Asia South Pacific Design Automat Conf"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/157485.164890"},{"key":"ref16","author":"decker","year":"2012","journal-title":"Singular 3-1-6—A Computer Algebra System for Polynomial Computations"},{"key":"ref17","author":"somenzi","year":"2015","journal-title":"Cudd Cu decision diagram package release 3 0 0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2005.1560081"},{"key":"ref19","first-page":"185","article-title":"Boolean Gröbner basis","author":"hansen","year":"2006","journal-title":"Proc Boolean Funct Cryptography Appl"},{"key":"ref28","year":"2007","journal-title":"ABC A System for Sequential Synthesis and Verification"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2011.5763035"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/196244.196446"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/978-3-540-70545-1_45","article-title":"An algebraic approach for proving data correctness in arithmetic data paths","author":"wienand","year":"2008","journal-title":"Proc Conf Computer-Aided Verification"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2501301"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008208521515"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2259540"},{"key":"ref8","first-page":"142","article-title":"Word-level traversal of finite state machines using algebraic geometry","author":"sun","year":"2016","journal-title":"Proc Workshop High-Level Design Validation and Test"},{"key":"ref7","author":"adams","year":"1994","journal-title":"An Introduction to Gröbner Bases"},{"key":"ref2","first-page":"836","article-title":"Improvements to combinational equivalence checking","author":"mishchenko","year":"2006","journal-title":"Proc Int Conf CAD (ICCAD)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2744925"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.02.017"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61474-5_55"},{"key":"ref21","first-page":"174","article-title":"Using the Gröbner basis algorithm to find proofs of unsatisfiability","author":"clegg","year":"1996","journal-title":"Proc ACM Symp Theory Comput"},{"key":"ref24","article-title":"Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal","author":"buchberger","year":"1965"},{"key":"ref23","first-page":"440","article-title":"Groebner bases computation in Boolean rings for symbolic model checking","author":"vardi","year":"2007","journal-title":"Proc IASTED Int Conf Model Simul"},{"key":"ref26","first-page":"3","article-title":"A criterion for detecting unnecessary reductions in the construction of a Gröbner bases","author":"buchberger","year":"1979","journal-title":"Proc Symb Algebraic Comput"},{"key":"ref25","article-title":"Counting zeros over finite fields with Gröbner bases","author":"gao","year":"2009"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/43\/8643655\/8323221-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/8643655\/08323221.pdf?arnumber=8323221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:09:42Z","timestamp":1657746582000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8323221\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":34,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2018.2818726","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}