New approach on Data Security Systems .. ... .....
This article presents a data encoding algorithm on which has been developed a digital file encryption software for which cyphering key levels have an extremely long lengths and which is not based on the RSA system or any other known system. (the produced cyphering keys lenghts vary from 3’000 to 9’000 bit, upto 27’000 bit long)
We know that as soon as we exceed a certain length in the size of the cyphering keys (usualy more than 2'048 bits long) it concerns a very sensitive domain of IT because it could potentially be considered to be usable as computer weapons.
We have also created another algorithm for the verification and the generation of Large Prime Numbers and it seems that it is more powerful than those other tools that we know and that are currently available on the internet.
Here again we know that this is an extremely sensitive field and because the tool that we are talking about has no known limits (except the one we impose ourselves concerning the physical hardware) it is very difficult for us to do all the tests so much the amount of primes numbers to test is important (no limits).
In reality, the main data securisation algorithm that we are presenting has nothing to do with the size of any producted and used cyphering keys, whether they are 3’000 bit long (3 sec to be generated) or 9’000 bit (30 sec) or even 27’000 bit (5 min).
These global cyphering keys are also not entirely randomly produced and their generation is based on an algorithm using the prime numbers which allows the software to maintain control over their final structure.
What makes the process random is that it use the notion of time as a dynamic factor and as the time varies constantly, it gives some final keys of large sizes with a random part.
The initial aspect of this cyphering algorithm is based on Re-Scheduling the binary structure of any source files and/or folder that you want to protect.
Thus, this makes it possible to produce protected data whose binary structure is completely Re-Scheduled, as well as 3 Physical-Key-Files making it possible to find a coherence when decoding the protected data.
The Main-Protected file thus obtained then has a completely Re-Scheduled binary structure which has been imposed by the 3 Physical-Key-Files which are totally destructured except the part of which we spoke initially and which concerns the very large cyphering keys.
What makes this way of protecting data irreversible once done is that all the files thus produced during the securisation process have absolutely no analysable coherence possible if they are studied outside their context.
Whether it is the Main-Protected data file or any of the other 3 Physical-Key-Files obtained, none of them can give any indication onto the nature of the original protected files and according to the options selected by the user during the encoding process, all information may be completely destroyed if an unauthorized third party tries to perform a scan on secure data (Main-Protected-File or those corresponding 3 Physical-Key-Files).
Here is a small video in 2 parts, the first part explains the different levels of data security and the second part demonstrates what means to "Re-Scheduling the Binary Structure" of the protected data and where is the location and size of the long cyphering keys (Small Random Bit part / 3'000 Bit / 9'000 Bit, 27'000 bit isn't yet authorised) :
Other videos are available on how to use this encryption software with different scenarios and options as well another demonstration video concerning the Prime Numbers verification and generation online tool :
Thank you for your interest.
P.S. We are sorry for the poor English level that we use, but as you certainly understand, this is not our first language… Thank you.