Authored by: Anonymous on Thursday, May 30 2013 @ 01:45 AM EDT |
RSA is:
Crypt = plain ^ encrypt MOD big_number
Plain = crypt ^ decrypt MOD big_number
Where only decrypt is not known .
There are programming tricks to speed up the above, but
instead of trying to factorise big_number how about encrypting
a known plain text and counting how many iterations of:
crypt(i) = crypt(i - 1) * crypt MOD big_number
where crypt(0) = 1 and crypt(n) = known plain?
Decrypt is then n.
RSA is only practically "uncrackable" due to the time factor
[Fixed the subject line - I made that same typo in a program
that went unspotted for ages whilst giving errors every so
often.] [ Reply to This | Parent | # ]
|
|
Authored by: Anonymous on Thursday, May 30 2013 @ 01:49 AM EDT |
RSA must be reversible otherwise it would not be used to send
messages!
Would you consider the function f(x) = x times 0 to not be
reversible?[ Reply to This | Parent | # ]
|
|
Authored by: Winter on Thursday, May 30 2013 @ 02:48 AM EDT |
In practice, NP hard comes down checking all possible solutions. In RSA this
means, check all possible keys, or a brute force attack.
---
Some say the sun rises in the east, some say it rises in the west; the truth
lies probably somewhere in between.[ Reply to This | Parent | # ]
|
|