This paper presents a fast pseudorandom generation algorithm,which is based on the BLAKE hash function and can pass the random test of the NIST（National Institute of Standards and Technology） Statistical Test Suite.Through theoretical analysis and experimental imitation,our new algorithm is proven to be more secure and efficient than G-SHA1.Simultaneously,we introduce and discuss the BLAKE in detail.Its security shows that can be utilized to generate pseudorandom bit sequences,which the experimental results show the BLAKE hash function has excellent pseudorandomness.Therefore,we believe the BLAKE is one of the most potential candidate algorithms of SHA-3 program.
WANG Houzhen1,2,ZHANG Huanguo1,2 1.Key Laboratory of Aerospace Information Security and Trusted Computing of Ministry of Education,Wuhan University,Wuhan 430072,Hubei,China
This paper presents a trusted-environment construction method based on the underlying hardware. This method aims at protecting the security-sensitive software in the aspects of software loading, running, and storing in the general operating system. It extends the trust chain of the traditional trusted computing technology to reach the target software, ensuring trusted loading. The extended memory management mechanism effectively pre- vents memory dumping and memory tampering for the high-sensitivity data. The file monitoring mechanism protects files from vicious operation made by attackers. Flexible-expanded storage environment provides the target software with static storing protection. Experimental system verifies that the method is suitable for general operating system and can effectively protect security-sensitive software with low overhead.
LI Jing1,2,ZHANG Huanguo1,2,ZHAO Bo1,2,FANG Lingling1,2 1.School of Computer,Wuhan University,Wuhan 430072,Hubei,China
The conception of orthomorphism has been generalized in this paper, and a counting formula on the generalized linear orthomorphism in the vector space over the Galois field with the arbitrary prime number p as the characteristic is obtained. Thus, the partial generation algorithm of generalized linear orthomorphism is achieved. The counting formula of the linear orthomorphism in the vector space over the finite field with characteristic 2 is the special case in our results. Furthermore, the generalized linear orthomorphism generated and discussed in this paper can gain the maximum branch number when they are designed as P-permutations.
