Sciweavers

FCS
2006
14 years 25 days ago
Polynomially Uncomputable Number-Theoretic Problems in Cryptography and Network Security
By far the most important automated tool for network and communications security is encryption, but encryption itself needs security. As we know, many cryptosystems and cryptograp...
Song Y. Yan, Glyn James, Gongyi Wu