基于GF（$2^m$）的语义混淆
Algorithmic Obfuscation over GF($2^m$)
摘要：
伽罗瓦域算术块是许多安全应用中的关键组件，例如椭圆曲线密码（ECC）和高级加密标准（AES）密码的S盒。介绍了一种基于模糊处理的硬件知识产权保护技术，重点研究了基于复杂GF运算和椭圆曲线点运算的GF乘法的模糊处理。模糊GF乘法电路是很重要的，因为GF乘法中不可约多项式的选择对硬件设计的性能有很大的影响，并且因为大量的精力都花在为给定的字段找到最佳的不可约多项式上，这可以为一家公司提供比另一家公司更有竞争力的优势。
英文摘要：
Galois Field arithmetic blocks are the key components in many security applications, such as Elliptic Curve Cryptography (ECC) and the S-Boxes of the Advanced Encryption Standard (AES) cipher. This paper introduces a novel hardware intellectual property (IP) protection technique by obfuscating arithmetic functions over Galois Field (GF), specifically, focusing on obfuscation of GF multiplication that underpins complex GF arithmetic and elliptic curve point arithmetic functions. Obfuscating GF multiplication circuits is important because the choice of irreducible polynomials in GF multiplication has the great impact on the performance of the hardware designs, and because the significant effort is spent on finding an optimum irreducible polynomial for a given field, which can provide one company a competitive advantage over another.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
