Error Detection in Polynomial Basis Multipliers over Binary Extension Fields
Error Detection in Polynomial Basis Multipliers over Binary Extension Fields
复制标题
二进制扩展域上多项式基乘法器的错误检测
DOI：
--
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
M. A. Hasan
中科院分区：
文献类型：
--
作者：
A. Reyhani;M. A. Hasan
在许多加密方案中，最耗时的基本算术操作是有限的字段乘法，其硬件实现可能需要数百万个逻辑大门。开发如此大的有限字段乘数是一项复杂且昂贵的任务，这将始终产生无错误的输出。在这种效果中，本文考虑了有限场中的容错乘积。它涉及在特征两个的有限字段上的比特和位多项式基础乘数的误差的检测。我们的方法是将乘数结构划分为许多较小的计算单元，并使用奇偶校验预测技术检测错误。
In many of cryptographic schemes, the most time consuming basic arithmetic operation is the finite field multiplication and its hardware implementation may require millions of logic gates. It is a complex and costly task to develop such large finite field multipliers which will always yield error free outputs. In this effect, this paper considers fault tolerant multiplication in finite fields. It deals with detection of errors of bit-parallel and bit-serial polynomial basis multipliers over finite fields of characteristic two. Our approach is to partition the multiplier structure into a number of smaller computational units and use the parity prediction technique to detect errors.