An Algebraic Approach to Verifying Galois-Field Arithmetic Circuits with Multiple-Valued Characteristics

• ITO Akira

  Tohoku University

• UENO Rei

  Tohoku University

• HOMMA Naofumi

  Tohoku University

抄録

This study presents a formal verification method for Galois-field (GF) arithmetic circuits with the characteristics of more than two values. The proposed method formally verifies the correctness of circuit functionality (i.e., the input-output relations given as GF-polynomials) by checking the equivalence between a specification and a gate-level netlist. We represent a netlist using simultaneous algebraic equations and solve them based on a novel polynomial reduction method that can be efficiently applied to arithmetic over extension fields $\mathbb{F}_{p^m}$, where the characteristic p is larger than two. By using the reverse topological term order to derive the Gröbner basis, our method can complete the verification, even when a target circuit includes bugs. In addition, we introduce an extension of the Galois-Field binary moment diagrams to perform the polynomial reductions faster. Our experimental results show that the proposed method can efficiently verify practical $\mathbb{F}_{p^m}$ arithmetic circuits, including those used in modern cryptography. Moreover, we demonstrate that the extended polynomial reduction technique can enable verification that is up to approximately five times faster than the original one.

収録刊行物

• IEICE Transactions on Information and Systems

  IEICE Transactions on Information and Systems E104.D (8), 1083-1091, 2021-08-01

  一般社団法人 電子情報通信学会

キーワード

• decision diagrams
• formal verification
• Galois-field arithmetic circuits
• multiple-valued logic

詳細情報

• CRID: 1390570387146101120
• NII論文ID: 130008070385
• DOI: 10.1587/transinf.2020lop0004
• ISSN: 17451361
• ISSN: 09168532
• Web Site: https://www.jstage.jst.go.jp/article/transinf/E104.D/8/E104.D_2020LOP0004/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• 抄録ライセンスフラグ: 使用不可