一种基于迭代的算术掩码与布尔掩码转换方法及系统
By constructing a complete binary tree and recursively calculating the Boolean mask sequence, and combining iterative adders to optimize Boolean mask addition, the problem of high carry-value calculation overhead in the conversion from arithmetic mask to Boolean mask is solved, the conversion efficiency is improved, and a balance between performance and security is achieved in side-channel security protection.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- SHANDONG UNIV
- Filing Date
- 2026-05-06
- Publication Date
- 2026-07-17
AI Technical Summary
In existing technologies, the conversion process from arithmetic mask to Boolean mask incurs high carry-value calculation overhead, resulting in low conversion efficiency and affecting the performance of side-channel security protection.
An iterative arithmetic mask to Boolean mask conversion method is adopted. By constructing a complete binary tree and recursively calculating the Boolean mask sequence, combined with an iterative adder to perform Boolean safe addition, the Boolean mask addition process is optimized and the carry value calculation overhead is eliminated.
It significantly improves the conversion efficiency between arithmetic masks and Boolean masks, achieving a better balance between performance and security while ensuring security.
Smart Images
Figure CN122160037B_ABST