14 Sep 2000 harrisj   » (Master)

More notes on theoretical aspects of encryption might be found at the course notes for the MIT class 6.857 taught by Ron Rivest. It took it in 1996, and it was most informative. Perhaps it can answer mattbradshaw's question a bit more coherently than me.


It seems that Public Key security is based on the difficulty of solving the Discrete Log Problem. For large prime numbers p, finding the factors for p-1 seems to be a difficult problem. No P-class algorithms are known, but it is not really easy to prove none exist. Searches for "Discrete Log Problem" might be useful for more information.

Was it Bill Gates who said that one of the challenges for future computer systems is "factoring large primes?" ;)

Latest blog entries     Older blog entries

New Advogato Features

New HTML Parser: The long-awaited libxml2 based HTML parser code is live. It needs further work but already handles most markup better than the original parser.

Keep up with the latest Advogato features by reading the Advogato status blog.

If you're a C programmer with some spare time, take a look at the mod_virgule project page and help us with one of the tasks on the ToDo list!