tag:blogger.com,1999:blog-3722233.post504005652709790524..comments2024-05-23T03:24:52.112-05:00Comments on Computational Complexity: Nash and the NSALance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-3722233.post-85396042510722023772012-02-29T17:24:36.347-06:002012-02-29T17:24:36.347-06:00Err...RSA is not a cipher, and AES is not "st...Err...RSA is not a cipher, and AES is not "structured" in the same sense that RSA is.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3722233.post-10677176240523008282012-02-27T17:06:46.381-06:002012-02-27T17:06:46.381-06:00Actually , on the last point, H. C. Pocklington dr...Actually , on the last point, H. C. Pocklington drew a distinction between an algorithm running in polynomial time and one running in exponential time as early as 1910, in a paper on how to compute the order of an element, mod p. We point this out in our book, Algorithmic Number Theory.Jeffrey Shallithttps://www.blogger.com/profile/12763971505497961430noreply@blogger.com