{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:40:45Z","timestamp":1781282445095,"version":"3.54.1"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/tcad.2013.2259540","type":"journal-article","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T18:02:08Z","timestamp":1376676128000},"page":"1409-1420","source":"Crossref","is-referenced-by-count":53,"title":["Efficient Gr\u00f6bner Basis Reductions for Formal Verification of Galois Field Arithmetic Circuits"],"prefix":"10.1109","volume":"32","author":[{"given":"Jinpeng","family":"Lv","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Priyank","family":"Kalla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"Enescu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51083-4_67"},{"key":"ref31","first-page":"3","article-title":"A criterion for detecting unnecessary reductions in the construction of Groebner bases","author":"buchberger","year":"1979","journal-title":"Proc Int Symp Symbolic Algebr Manipulat"},{"key":"ref30","first-page":"899","article-title":"Efficient Groebner basis reductions for formal verification of Galois field multipliers","author":"lv","year":"2012","journal-title":"Proc Design Automat Test Europe Conf Exhib"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1109\/TC.2002.1004591","article-title":"Montgomery multiplier and squarer for a class of finite fields","volume":"51","author":"wu","year":"2002","journal-title":"IEEE Trans Comput"},{"key":"ref11","first-page":"311","author":"barrett","year":"1987","journal-title":"Advances in Cryptology"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48892-8_16"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.1999.761096"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2002.804386"},{"key":"ref16","first-page":"836","article-title":"Improvements to combinational equivalence checking","author":"mishchenko","year":"2006","journal-title":"Proc Int Conf Comput -Aided Design"},{"key":"ref17","first-page":"892","article-title":"A circuit SAT solver with signal correlation guided learning","author":"lu","year":"2003","journal-title":"Proc Design Automat Test Europe Conf Exhib"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_5"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/196244.196444"},{"key":"ref28","first-page":"141","article-title":"Formal verification of error correcting circuits using computational algebraic geometry","author":"lvov","year":"2012","journal-title":"Proc Formal Methods Comput -Aided Design"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.148"},{"key":"ref27","author":"gao","year":"2009","journal-title":"Counting Zeros over Finite Fields with Gro?bner Bases"},{"key":"ref3","first-page":"77","article-title":"Modular reduction in <formula formulatype=\"inline\"><tex Notation=\"TeX\">${\\rm GF}(2^{n})$<\/tex><\/formula> without pre-computational phase","author":"kne?evi?","year":"2008","journal-title":"Proc Int Workshop Arithmetic Finite Fields"},{"key":"ref6","author":"adams","year":"1994","journal-title":"An Introduction to Gr\ufffdbner Bases"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2011.5763035"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_13"},{"key":"ref8","author":"decker","year":"2011","journal-title":"Singular 3-1-3?A computer algebra system for polynomial computations"},{"key":"ref7","author":"buchberger","year":"1965","journal-title":"Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008208521515"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(99)00005-5"},{"key":"ref1","author":"mastrovito","year":"1991","journal-title":"VLSI architectures for computation in Galois fields"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/217474.217583"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.888277"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/HLDVT.2004.1431237"},{"key":"ref24","first-page":"188","article-title":"Hardware\/software co-verification of cryptographic algorithms using Cryptol","author":"erk\ufffdk","year":"2009","journal-title":"Proc Formal Methods Comput -Aided Design"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2059271"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_45"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2007.4601876"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/6582559\/06582606.pdf?arnumber=6582606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T18:20:23Z","timestamp":1640283623000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6582606\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":32,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2013.2259540","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}