面向密码算法的非线性布尔函数实现技术研究

Research on nonlinear Boolean functions realization of cryptographic algorithms

为了提升密码算法中非线性布尔函数实现效率,设计了串行与电路和以查找表为基础的并行化低次布尔函数实现架构,分别实现高次与项和低次与项。分析了不同并行化查找表实现密码算法中低次布尔函数的效率。结果表明,结合香农分解定理提出的并行化查找表架构处理性能可以达到1.02 GHz,不仅能够灵活适配密码算法中的非线性布尔函数,而且能够节省资源占用。

In order to enhance the non-linear Boolean functions of cryptographic algorithms to achieve efficiency, this paper designs a serial and-circuit for high-order and the table-based parallelization framework to achieve low-order Boolean function. The paper analyzes the efficiency of different parallelization lookup table to achieve the low-order Boolean function of cryptographic algorithms. The results show that,combined with Shannon decomposition theorem,the processing performance of prorosed parallel archtecture of the lookup table can reach 1.02 GHz, which can not only flexiblely adapte the non-linear Boolean function, but also save resource consumption.