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 cryptographic protocols are based their security on some computationally intractable mathematical problems. In this paper, we shall discuss some of the number-theoretic problems that are currently polynomially uncomputable and thus provide a good base for cryptography and network security.

• Type: Conference
• Year: 2006
• Where: FCS
• Authors: Song Y. Yan, Glyn James, Gongyi Wu
• Keywords: Communications Security, FCS 2006, FCS 2007, Important Automated Tool, Intractable Mathematical Problems