Search

Let X be a finite simple undirected graph and G an automorphism group of X. If G is transitive on s-arcs but not on (s+1)-arcs then X is called (G,s)-transitive. Let X be a connected (G,s)-transitive graph of a prime valency p, and Gv the vertex stabilizer of a vertex v ∈ V(X) in G. For the case p=3, the exact structure of Gv has been determined by Djoković and Miller in [Regular groups of automorphisms of cubic graphs, J. Combin. Theory (Ser. B) 29 (1980) 195 - 230]. For the case p=5, all the possibilities of Gv have been given by Guo and Feng in [A note on pentavalent s-transitive graphs, Discrete Math. 312 (2012) 2214 - 2216]. In this paper, we deal with the case p=7 and determine the exact structure of the vertex stabilizer Gv. [ABSTRACT FROM AUTHOR]

In this paper, we propose an algorithm for one-way hash function construction based on the chaotic look-up table with changeable parameter. First, the original message with padding is divided into block messages as groups and then further broken into sub-block messages, which are translated into corresponding ASCII codes by groups. Then the group ASCII codes are successively inputted into the chaotic look-up table updated by changeable parameter to permute corresponding values. Finally, based on the calculation of the values, 128-bit hash value is generated. Performance analysis indicates that our proposed algorithm satisfies sensitive requirements and can resist all kinds of attacks. [ABSTRACT FROM AUTHOR]