In December of 2010 NIST selected five SHA-3 finalists - BLAKE, Grcstl, JH, Keccak, and Skein to advance to the third （and final） round of the SHA-3 competition. At present most specialists and scholars focus on the...In December of 2010 NIST selected five SHA-3 finalists - BLAKE, Grcstl, JH, Keccak, and Skein to advance to the third （and final） round of the SHA-3 competition. At present most specialists and scholars focus on the design and the attacks on these hash functions. However, it is very significant to study some properties of their primitives and underlying permutations. Because some properties reflect the pseudo-randomness of the structures. Moreover, they help us to find new cryptanalysis for some block cipher structures. In this paper, we analyze the resistance of JH and Grcstl-512 against structural properties built on integral distinguishers. And then 31.5 （out of 42） rounds integral distinguishers for JH compression function and 11.5 （out of 14） rounds for Grcstl-512 compression function are presented.展开更多
The fixed points in logistic mapping digital-flow chaos strange attractor arestudied in detail. When k=n in logistic equation, there exist no more than 2n fixed points, whichare deduced and proved theoretically. Three...The fixed points in logistic mapping digital-flow chaos strange attractor arestudied in detail. When k=n in logistic equation, there exist no more than 2n fixed points, whichare deduced and proved theoretically. Three corollaries about the fixed points of logistic mappingare proposed and proved respectively. These theorem and corollaries provide a theoretical basis forchoosing parameter of chaotic sequences in chaotic secure communication and chaotic digitalwatermarking. And they are testified by simulation.展开更多
The sequences which consist of any segment of a chaos sequence are called asC-sequences. These sequences could be used as a kind of input signals to replace M-sequences in theprocess identification. This substitution ...The sequences which consist of any segment of a chaos sequence are called asC-sequences. These sequences could be used as a kind of input signals to replace M-sequences in theprocess identification. This substitution is theoretically proved to be feasible. InverseC-sequences are created in a way similar to inverse M-sequences to solve the problem thatC-sequences have non-ideal balance property, that is, the numbers of '0' and '1' are unequal.Besides its good pseudo-random property, the sequences have other advantages such as easy togenerate, varieties of the segment and adjustable cycle time.展开更多
基金Supported by the National Natural Science Foundation of China (No. 60873259 and No. 60903212)Knowledge Innovation Project of the Chinese Academy of Sciences
文摘In December of 2010 NIST selected five SHA-3 finalists - BLAKE, Grcstl, JH, Keccak, and Skein to advance to the third （and final） round of the SHA-3 competition. At present most specialists and scholars focus on the design and the attacks on these hash functions. However, it is very significant to study some properties of their primitives and underlying permutations. Because some properties reflect the pseudo-randomness of the structures. Moreover, they help us to find new cryptanalysis for some block cipher structures. In this paper, we analyze the resistance of JH and Grcstl-512 against structural properties built on integral distinguishers. And then 31.5 （out of 42） rounds integral distinguishers for JH compression function and 11.5 （out of 14） rounds for Grcstl-512 compression function are presented.
基金This work was financially supported by the National Natural Science Foundation of China(No.69772014).]
文摘The fixed points in logistic mapping digital-flow chaos strange attractor arestudied in detail. When k=n in logistic equation, there exist no more than 2n fixed points, whichare deduced and proved theoretically. Three corollaries about the fixed points of logistic mappingare proposed and proved respectively. These theorem and corollaries provide a theoretical basis forchoosing parameter of chaotic sequences in chaotic secure communication and chaotic digitalwatermarking. And they are testified by simulation.
基金This work was financially supported by the National Natural Science Foundation of China (No.70071047, No.10247005)the Postdoctoral Science Foundation of China (No.2002032129)
文摘The sequences which consist of any segment of a chaos sequence are called asC-sequences. These sequences could be used as a kind of input signals to replace M-sequences in theprocess identification. This substitution is theoretically proved to be feasible. InverseC-sequences are created in a way similar to inverse M-sequences to solve the problem thatC-sequences have non-ideal balance property, that is, the numbers of '0' and '1' are unequal.Besides its good pseudo-random property, the sequences have other advantages such as easy togenerate, varieties of the segment and adjustable cycle time.
