透過您的圖書館登入
IP:18.117.137.64

摘要


The notion of transparency order was proposed by Prouff at the 2005 FSE. Based on the idea of differential power consumption, established the close relationship between the (m; n) function and the Hamming distance model, obtained the transparency order of S-box and some traditional cryptographic properties could not reach the best at the same time. There were some constraint relations between them. In this paper, we give the relationship between the upper and low bound on the transparency order and the absolute indicator of a Boolean function and study the transparency order of several types of functions such as resilient Boolean function, balanced SAC function and so on. Finally, we introduce the relationship between the upper bound on the transparency order and Signal-to-noise ratio of a Boolean function, obtain that the upper bound on the transparency order is inversely proportional to the Signal-to-noise ratio, and verify the result.

延伸閱讀