Research and design of multidimensional computer system--basic principle (II.)

 Research and design of multidimensional computer system--basic principle (II.) A.  application of multidimensional system in the field of data encryption

Before detailing the concept of a multidimensional computer, let's share several application examples, based on specific application descriptions, to better understand the benefits of multidimensional.

1.1. an encryption method that cannot be violently cracked

In the traditional field of computer data encryption, there is no absolute security encryption algorithm, any encryption algorithm can not eliminate the possibility of brute force, the only difference is the cost of the time required to the size.

but in the multidimensional computer system, this situation has been fundamentally improved. From high-dimensional encryption of low-latitude data can not be broken in the traditional violent way, whether there is the possibility of cracking is only a probability problem. This is because the higher dimensional data encryption is not limited to the two-dimensional mathematical algorithm, only at the current stage of development, we can support the Data Encryption level of 6 dimensions, in such a multidimensional level of encryption support, The traditional act of brute force has become meaningless.

example: with a simple eight-bit key 128 1 The number of vertices is 1 256 The key can be cracked by the operation.

However, when this value is 1 when the vertex is moving in the time dimension, the value of the key will follow the CPU the accumulation of the clock fragment changes together as shown in the following:

therefore, when the crack program attempts to brute force to crack the key, each time the clock fragment attempt only a certain probability to guess the correct value of the key, even if the completion the the second cycle attempt can not confirm the crack must be successful, unless the cracker in the process of cracking the key to add the concept of time dimension, otherwise the password will not exist must be able to crack the successful method.

So, since the higher dimensions of encryption can improve the security of data encryption, the higher latitude of the crack method can be more effective to solve the current common two-dimensional mathematical encryption algorithm?

For this problem, we do not do in-depth description, but can be confirmed that any low-dimensional algorithm in the high-latitude angle of view is a trace of a picture, its crack more difficult than in the same dimension is much simpler.

1.2. Benefits of data Dimensions

Higher data dimensions represent a richer amount of content that can be hosted by data in units of length, and similarly, in the case of the same code volume, the algorithm at a higher latitude can show more variation.

Please see the following example: X + 1 = Y

in the traditional field of mathematics, the equationXafter confirmationYthere will be only one solution. And in the multidimensional algorithm,Xconfirmation is just the first step inXwhen the values are confirmed, the change in the time dimension will also beYresult in a different value. and the exact number of such results is not the same, whenXThe more changes in the time dimension,Ythe result of the evaluation will also increase, the conversion to the code amount is the following form:

Switch ( x )

Case T :

...

It can be seen that, from the traditional mathematical formula conversion to multi-dimensional calculation, the increase in computation is multiplied, the benefits may be in a simple application level is not very obvious, but in such areas as neural network algorithm will bring qualitative improvement.

Research and design of multidimensional computer system--basic principle (II.)