The autocorrelation of a Boolean function possesses the capability to reflect such characteristics as linear structure, Strict Avalanche Criterion(SAC) and Propagation Criterion(PC)of degree k. But it can do nothing i...The autocorrelation of a Boolean function possesses the capability to reflect such characteristics as linear structure, Strict Avalanche Criterion(SAC) and Propagation Criterion(PC)of degree k. But it can do nothing in determining the order of SAC or PC. A calculating table for the autocorrelation is constructed in this paper so as to show what is beyond the autocorrelation and how the three cryptographic characteristics are exhibited. A deeper study on the calculating table in a similar way has helped us to develop a new concept, named as the general autocorrelation, to address efficiently the problem how to determine the orders of SAC and PC. The application on the Advanced Encryption Standard(AES) shows the SAC and PC characteristics of Boolean functions of AES S-box.展开更多
Identity-based （ID-based） ring signature has drawn great concerns in recent years and many ID-based ring signature schemes have been proposed until now. Unfortunately, all of these ID-based ring signatures are const...Identity-based （ID-based） ring signature has drawn great concerns in recent years and many ID-based ring signature schemes have been proposed until now. Unfortunately, all of these ID-based ring signatures are constructed from bilinear pairings, a powerful but computationally expensive primitive. Hence, ID-based ring signature without pairing is of great interest in the field of cryptography. In this paper, the authors firstly propose an ID-based ring signature scheme based on quadratic residues. The proposed scheme is proved to be existentially unforgeable against adaptive chosen message-and-identity attack under the random oracle model, assuming the hardness of factoring. The proposed scheme is more efficient than those which are constructed from bilinear pairings.展开更多
基金Partially supported by the National 973 Project(G1999035803)National 863 Project (2002AA143021)the National Cryptography Development Funds for the Tenth Fiveyear Project
文摘The autocorrelation of a Boolean function possesses the capability to reflect such characteristics as linear structure, Strict Avalanche Criterion(SAC) and Propagation Criterion(PC)of degree k. But it can do nothing in determining the order of SAC or PC. A calculating table for the autocorrelation is constructed in this paper so as to show what is beyond the autocorrelation and how the three cryptographic characteristics are exhibited. A deeper study on the calculating table in a similar way has helped us to develop a new concept, named as the general autocorrelation, to address efficiently the problem how to determine the orders of SAC and PC. The application on the Advanced Encryption Standard(AES) shows the SAC and PC characteristics of Boolean functions of AES S-box.
基金Supported by the National High Technology Research and Development Program of China (No. 2006AA01Z428)the National Natural Science Foundation of China ( No. 60673075)
文摘Identity-based （ID-based） ring signature has drawn great concerns in recent years and many ID-based ring signature schemes have been proposed until now. Unfortunately, all of these ID-based ring signatures are constructed from bilinear pairings, a powerful but computationally expensive primitive. Hence, ID-based ring signature without pairing is of great interest in the field of cryptography. In this paper, the authors firstly propose an ID-based ring signature scheme based on quadratic residues. The proposed scheme is proved to be existentially unforgeable against adaptive chosen message-and-identity attack under the random oracle model, assuming the hardness of factoring. The proposed scheme is more efficient than those which are constructed from bilinear pairings.
