Algebraic Techniques for Rectification of Finite Field Circuits
Algebraic Techniques for Rectification of Finite Field Circuits
复制标题
DOI：
10.1109/vlsi-soc53125.2021.9606976
复制
发表时间：
2021-10
期刊：
影响因子：
--
通讯作者：
V. Rao;Haden Ondricek;P. Kalla;Florian Enescu
中科院分区：
文献类型：
--
作者：
V. Rao;Haden Ondricek;P. Kalla;Florian Enescu
本文利用多项式代数中的技巧，通过在内部网络上计算面片函数来纠正有缺陷的有限域运算电路。目前使用SAT求解和Craig插值法的方法在整流算术电路中是不可行的。在给定候选网络的情况下，现有的基于代数的技术可以确定电路是否允许在这些网络上进行多修复校正，但不能计算面片函数。我们展示了代数计算模型如何促进对网络的允许校正函数的探索。该模型还允许利用无关紧要的条件来合成和实现补丁。在密码学中使用的大操作数宽度有限域基准测试上的实验结果证实了我们的方法。
This paper addresses the rectification of faulty finite field arithmetic circuits by computing patch functions at internal nets using techniques from polynomial algebra. Contemporary approaches that utilize SAT solving and Craig interpolation are infeasible in rectifying arithmetic circuits. Given candidate nets, prior algebra-based techniques can ascertain whether the circuit admits multi-fix rectification at these nets but cannot compute patch functions. We show how the algebraic computing model facilitates the exploration of admissible rectification functions, collectively, for the nets. This model also enables the exploitation of don’t care conditions for the synthesis and realization of the patches. Experimental results on large operand width finite field benchmarks, as used in cryptography, substantiate our approach.