The Research And Implementation Of Generic Character Space Decomposing And Searching Strategy

With the advent of science and technology information society, password protectiontechnology has become one of the hot topics of the current field of information security.Enhanced people’s awareness of information and password protection technology continues toevolve increase the difficulty of brute forcing. The searching for characters spaces is the basictechnical points, and the traditional password cracking software can only support ASCII codecharacter space, for example, the famous industry brute force—John The Ripper, onlysupports to95full keyboard characters. Obviously, they are for powerless for non-ASCIIcharacters spaces.In recent years, the rapid development of parallel and distributed computing technology,provides a the search character space in the large-scale cluster system software and hardwareplatform based support, in order to maximize the use of the computing power of a cluster, fora complete computing tasks character space, it must be decomposed into a number of smallerspace characters, in order to adapt to the computing power of heterogeneous computing nodes,making computing tasks can be sustained and efficient execution. At this point, the characterspace decomposition algorithm will have a direct impact on the efficiency of the clustercharacter space searching.In response to these problems, this paper presents a description for the universal characterspace, so that the composition of the characters spaces is not limited to the ASCII code, andalso be able to support multiple languages. It’s a good solution to the problem of the searchingfor non-ASCII characters spaces. For the universal character space, we present an adaptivecomputing resources and character space the decomposition granularity controllablealgorithm, in order to achieve load balancing between computing nodes. The presentedmulti-character space optimization algorithm based on the searching mode, it can describeone or more characters spaces and search each character space by the particular order. Finally,conducted a series of experimental work, the experimental results demonstrate the accuracyand efficiency of decomposition and search strategies.