Accession Number : ADA182130

Title :   Some Complexity Theory for Cryptography.

Descriptive Note : Final rept. Jun-Aug 85,

Corporate Author : NAVAL RESEARCH LAB WASHINGTON DC

Personal Author(s) : Gaglione,Anthony M

PDF Url : ADA182130

Report Date : 12 Jun 1987

Pagination or Media Count : 21

Abstract : This report concerns some of the elementary concepts in complexity theory. In particular, a mathematical model is developed for a finite-state machine and the Turing machine. This model has applications to public key cryptosystems, in determining which problems are P, NP, or NPC. The report was written to be as accessible to the nonspecialist as possible.

Descriptors :   *CRYPTOGRAPHY, THEORY, MATHEMATICAL MODELS

Subject Categories : Cybernetics

Distribution Statement : APPROVED FOR PUBLIC RELEASE