Talk:RSA code: Difference between revisions

m
→‎RSA129 as an example: the exponentiation problem
(→‎RSA129 as an example: rsa 129 details)
m (→‎RSA129 as an example: the exponentiation problem)
Line 44:
 
: [http://www.willamette.edu/~mjaneba/rsa129.html RSA 129 factors]
: [[wp:The_Magic_Words_are_Squeamish_Ossifrage| The RSA 129 text "The Magic Words are Squeamish Ossifrage"]]
: [[http://www.math.okstate.edu/~wrightd/numthry/rsa129.html summaries of rsa 129 status reports and full details of keys (see below)
: [[wp:Modular_exponentiation|Modular exponentiation]] will challenge any naive implementation of RSA. Your bignums may blow up decrypting the message above.
 
-[[User:Dgamey|Dgamey]] 15:56, 22 April 2011 (UTC) update: --[[User:Dgamey|Dgamey]] 1518:3908, 24 April 2011 (UTC)
 
=== RSA 129 - Final Answer (April 27, 1994) ===
Anonymous user