Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Finite field for scientists and engineers
Finite field for scientists and engineers
DAC '94 Proceedings of the 31st annual Design Automation Conference
Montgomery Multiplication in GF(2^k
Designs, Codes and Cryptography
Montgomery Multiplier and Squarer for a Class of Finite Fields
IEEE Transactions on Computers
VLSI Designs for Multiplication over Finite Fields GF (2m)
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A criterion for detecting unnecessary reductions in the construction of Groebner bases
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Towards Efficient Verification of Arithmetic Algorithms over Galois Fields GF(2m)
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
MODD for CF: a representation for fast evaluation of multiple-output functions
HLDVT '04 Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International
An Algebraic Approach for Proving Data Correctness in Arithmetic Data Paths
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Modular datapath optimization and verification based on modular-HED
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Formal Verification of Galois Field Multipliers Using Computer Algebra Techniques
VLSID '12 Proceedings of the 2012 25th International Conference on VLSI Design
Equivalence Verification of Polynomial Datapaths Using Ideal Membership Testing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hierarchical Verification of Galois Field Circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verification of composite Galois field multipliers over GF ((2
HLDVT '11 Proceedings of the 2011 IEEE International High Level Design Validation and Test Workshop
Proof logging for computer algebra based SMT solving
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |
Galois field arithmetic finds application in many areas, such as cryptography, error correction codes, signal processing, etc. Multiplication lies at the core of most Galois field computations. This paper addresses the problem of formal verification of hardware implementations of (modulo) multipliers over Galois fields of the type F2k, using a computer-algebra/algebraic-geometry based approach. The multiplier circuit is modeled as a polynomial system in F2k[x1, x2, ···, xd] and the verification problem is formulated as a membership test in a corresponding (radical) ideal. This requires the computation of a Gröbner basis, which can be computationally intensive. To overcome this limitation, we analyze the circuit topology and derive a term order to represent the polynomials. Subsequently, using the theory of Gröbner bases over Galois fields, we prove that this term order renders the set of polynomials itself a Gröbner basis of this ideal -- thus significantly improving verification. Using our approach, we can verify the correctness of, and detect bugs in, upto 163-bit circuits in F2163; whereas contemporary approaches are infeasible.