Based on the theory of polymorphic virtual S-box, the paper presents a symmetric key exchange protocol to solve the problem of session keys delete shared in the computational complexity temporary trading scenario. Bot...Based on the theory of polymorphic virtual S-box, the paper presents a symmetric key exchange protocol to solve the problem of session keys delete shared in the computational complexity temporary trading scenario. Both parties jointly construct a highly nonlinear SPN core algorithm. The paper the connotation of polymorphic cipher theory, making use of the method of self-compiler based expansion factor to collect random parameter sets held by each of the parties containing its own information 5-tuple private keys array Kpa[5] and Kpb[5].The more efficient polymorphism virtual S-box is constructed. The method of secret split for the public key cryptography features can be implemented by symmetry cipher system. The research results will provide a theoretical basis to solve the key exchange problems for short- term communications partner based on symmetric cryptography.展开更多
The strict avalanche criterion(SAC)is one of the most important cryptographic criteria for substitution boxes(S-boxes)used in many symmetric encryption systems.However,there are few constructive methods for S-boxes fu...The strict avalanche criterion(SAC)is one of the most important cryptographic criteria for substitution boxes(S-boxes)used in many symmetric encryption systems.However,there are few constructive methods for S-boxes fulfilling the SAC until now.In this paper,to construct S-boxes satisfying the SAC directly,we generalize the concatenation techniques of Boolean functions to S-boxes.Using the idea of concatenating small variable S-boxes,we present a simple yet effective construction method of S-boxes satisfying the SAC.Finally,a simple example on how to construct SAC S-boxes with large input variables by small variables SAC S-boxes is given.展开更多
基金the National Natural Science Foundation of China under Grant No.61272038 and No.61340059,Zhengzhou Academician Workstation Funded Projects,the Education Department of Henan Province Science and Technology Research Project,Key Project of Science and Technology Research,the Doctor Fund of Zhengzhou University of Light Industry
文摘Based on the theory of polymorphic virtual S-box, the paper presents a symmetric key exchange protocol to solve the problem of session keys delete shared in the computational complexity temporary trading scenario. Both parties jointly construct a highly nonlinear SPN core algorithm. The paper the connotation of polymorphic cipher theory, making use of the method of self-compiler based expansion factor to collect random parameter sets held by each of the parties containing its own information 5-tuple private keys array Kpa[5] and Kpb[5].The more efficient polymorphism virtual S-box is constructed. The method of secret split for the public key cryptography features can be implemented by symmetry cipher system. The research results will provide a theoretical basis to solve the key exchange problems for short- term communications partner based on symmetric cryptography.
基金Supported by the National Science Foundation of China(No.60773002,61072140)the 111 Project(No.B08038),the Doctoral Program Foundation of Institutions of Higher Education of China(No.20100203110003)+1 种基金the Fundamental Research Funds for the Central Universities(No.JY10000901034)the Anhui Provincial Natural Science Foundation(No.1208085QF119)
文摘The strict avalanche criterion(SAC)is one of the most important cryptographic criteria for substitution boxes(S-boxes)used in many symmetric encryption systems.However,there are few constructive methods for S-boxes fulfilling the SAC until now.In this paper,to construct S-boxes satisfying the SAC directly,we generalize the concatenation techniques of Boolean functions to S-boxes.Using the idea of concatenating small variable S-boxes,we present a simple yet effective construction method of S-boxes satisfying the SAC.Finally,a simple example on how to construct SAC S-boxes with large input variables by small variables SAC S-boxes is given.
基金supported by the National Natural Science Foundation of China under Grant No.10871106
文摘For a class of generalized Feistel block ciphers, an explicit formula for the minimum numbers of linearly active S-boxes of any round r is presented.