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 program of auto-identification of wear particles is given using aritficial neural network(ANN)technique,based on a set of debris morphology descriptor that de-scribes the shape characters of wear particles.The tra...The program of auto-identification of wear particles is given using aritficial neural network(ANN)technique,based on a set of debris morphology descriptor that de-scribes the shape characters of wear particles.The train-ing speed of the network with thw fuzzy-factor is muchfaster than that of the traditional methods.For esamale,the speed of training the network in this paper is increased five times in Exclusive OR problem(XORproblem)than other ways,and the debris chassification accuracy is more than 90% by this method,and the idemtification speed is very fast.展开更多
A Hamiltonian k-factor is a k-factor containing aHamiltonian cycle.An n/2-critical graph G is a simple graph of order n which satisfies δ(G)≥n/2 and δ(G-e)<n/2 for any edge e∈E(G).Let k≥2 be an integer and G b...A Hamiltonian k-factor is a k-factor containing aHamiltonian cycle.An n/2-critical graph G is a simple graph of order n which satisfies δ(G)≥n/2 and δ(G-e)<n/2 for any edge e∈E(G).Let k≥2 be an integer and G be an n/2-critical graph of even order n≥8k-14.It is shown in this paper that for any given Hamiltonian cycle C except that G-C consists of two components of odd orders when k is odd,G has a k-factor containing C.展开更多
基金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.
文摘The program of auto-identification of wear particles is given using aritficial neural network(ANN)technique,based on a set of debris morphology descriptor that de-scribes the shape characters of wear particles.The train-ing speed of the network with thw fuzzy-factor is muchfaster than that of the traditional methods.For esamale,the speed of training the network in this paper is increased five times in Exclusive OR problem(XORproblem)than other ways,and the debris chassification accuracy is more than 90% by this method,and the idemtification speed is very fast.
基金This research is supported partially by the National Natural Science Foundation of China.
文摘A Hamiltonian k-factor is a k-factor containing aHamiltonian cycle.An n/2-critical graph G is a simple graph of order n which satisfies δ(G)≥n/2 and δ(G-e)<n/2 for any edge e∈E(G).Let k≥2 be an integer and G be an n/2-critical graph of even order n≥8k-14.It is shown in this paper that for any given Hamiltonian cycle C except that G-C consists of two components of odd orders when k is odd,G has a k-factor containing C.
