Accession Number : ADA291910
Title : Computational Complexity and Encryption.
Descriptive Note : Final rept.,
Corporate Author : ARMY MISSILE COMMAND REDSTONE ARSENAL AL SYSTEMS SIMULATION AND DEVELOPMENT DIRECTORATE
Personal Author(s) : Coward, John R.
PDF Url : ADA291910
Report Date : FEB 1995
Pagination or Media Count : 15
Abstract : Complexity theory has had a major impact on the design of encryption algorithms. Number theory has also made important contributions and is now the focus of much research in the cryptographic community. Work in theoretical computer science has lead to the development of a polynomial hierarchy used to classify the computational complexity of problems which are difficult to solve. NP-Complete problems have proven to be an excellent vehicle for the development of encryption algorithms. Asymmetrical (Public Key) encryption uses complexity theory for the design of algorithms that provide information security and integrity. Encryption algorithms based on complexity theory are relatively new, and questions remain about the security and integrity of these algorithms. Complexity theory has proven to this point to be a powerful ally in the design of encryption algorithms, but only time will tell if the polynomial hierarchy is real, or if advances in mathematics and computer science will render these algorithms insecure.
Descriptors : *CRYPTOGRAPHY, *DATA PROCESSING SECURITY, ALGORITHMS, COMPUTATIONS, COMPUTERS, THEORY, POLYNOMIALS, HIERARCHIES, NONLINEAR PROGRAMMING, NUMBER THEORY.
Subject Categories : Cybernetics
Computer Systems Management and Standards
Distribution Statement : APPROVED FOR PUBLIC RELEASE