HELP! * GREY=local LOCAL HTML version of Foils prepared August 4 1996
Foil 93 Near and Future Projects
From MetaComputing -- the Informal Supercomputer Tutorial for CRPC Annual Meeting at Argonne -- May 13 1996. byMark Baker * See also color IMAGE
WWW-Based Project Undertaken at NPAC
RSA Factoring Challenge
In RSA the secret key can be derived from the public key.
Factoring large numbers is believed to be hard - so RSA is believed to be secure.
Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.
