低随机数依赖的二阶毛刺探测安全uBlock实现OA

As a mainstream side-channel protection method,Boolean masking technology has signif-icant advantages in improving the security,flexibility,composability,and wide application of crypto-graphic implementation,while high-order Boolean masking usually costs a large amount of resources,such as random numbers and area.This work studies and designs two second-order threshold im-plementation schemes for uBlock,which significantly reduce the random number requirement for the S-box module.The first scheme is based on the direct S-box,using a trinomial threshold implementa-tion method,requiring only 74 bit of random numbers;the second scheme is based on the decomposed S-box,using a domain-oriented masking technology,which only requires 14 bit of random numbers,thereby greatly reduced the use of random numbers.The formal verification tool PROVER is used to conduct security verification under the glitch detection model on the two S-box implementations.The Synopsys Design Compiler tool is used to analyze and compare the resource consumption of the two proposed solutions.Finally,the hardware implementation of the solution is analyzed and evalu-ated using Test Vector Leakage Assessment(TVLA).Experimental results show that the two schemes proposed in this work are safe under first-order and second-order t-tests.