A New Algorithm for Switching from Arithmetic to Boolean Masking
A New Algorithm for Switching from Arithmetic to Boolean Masking
复制标题
一种从算术掩码切换到布尔掩码的新算法
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
Alexei Tchulkine
中科院分区：
文献类型：
--
作者：
J. Coron;Alexei Tchulkine
为了保护密码算法不受差分功率分析的影响，一般的方法是用随机值屏蔽所有中间数据。当加密算法将布尔运算与算术运算结合在一起时，就需要在布尔屏蔽和算术屏蔽之间进行转换。Louis Goubin在[6]中提出了一种将布尔掩码转换为算术掩码的有效方法。然而，[6]中从算术屏蔽转换为布尔屏蔽的方法效率较低。在某些实现中，这种转换可能成为瓶颈。在本文中，我们提出了一种由算术掩码转换为布尔掩码的改进算法。我们的方法可以应用于诸如IDEA和RC6之类的加密方案，以及诸如SHA-1之类的散列算法。
To protect a cryptographic algorithm against Differential Power Analysis, a general method consists in masking all intermediate data with a random value. When a cryptographic algorithm combines boolean operations with arithmetic operations, it is then necessary to perform conversions between boolean masking and arithmetic masking. A very efficient method was proposed by Louis Goubin in [6] to convert from boolean masking to arithmetic masking. However, the method in [6] for converting from arithmetic to boolean masking is less efficient. In some implementations, this conversion can be a bottleneck. In this paper, we propose an improved algorithm to convert from arithmetic masking to boolean masking. Our method can be applied to encryption schemes such as IDEA and RC6, and hashing algorithms such as SHA-1.