|
The RSA security standard algorithm bases itself on the fact that it is very difficult, given the sum of two large prime numbers, to determine which two prime numbers were actually added to get that sum. Brute Force attack of this algorithm has an estimated time to crack of 2 years. Prime numbers with their very definition impose very complicated calculations that need to be done to generate them in a computer. To generate two of them in all possible combinations with no upper bound on their magnitude, is a very difficult thing for computers indeed. Hence RSA is chosen as a security standard. On analyzing, we see that Number theory and ‘difficulty to computers’ as the main reason that makes RSA what it is. Why don’t we implement a similar algorithm concerning huge numbers, multiple uncertainties, and impose huge computer calculations for the brute force attack technique? Once we achieve all these we get an algorithm similar to RSA. But we do not need one similar to RSA, what we need is one that is faster and more flexible than RSA and with CCura+, this goal is what is kept in mind.
|