I was wondering that what make RSA Asymmetric Cryptography Algorithm special. So I wrote a very simple algorithm that do the same work (Generate Public and Private Key) Now I want to ask you that What is the excellence of RSA vs my algorithm ? What's your idea?
This is my algorithm :
n = random
e = factorial(n) /* Public Key */
d = test(e) /* Private Key */
test()
{
return XXOXOXXOOXO /* X values are some random numbers &
O is the digits of e number in order */
}
[-] e just has 5 digits. [-] test function, actually generates couple of different random numbers (X) and combine the random numbers with O that are e digits.
So now we can get e from d but it's impossible to obtain d from e unless we guess all the possible values (Brute Force it) that needs time as the same as RSA.