Some Complexity Theory for Cryptography.

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 12, 1987
Accession Number
ADA182130

Entities

People

  • Anthony M. Gaglione

Organizations

  • United States Naval Research Laboratory

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Alphabets
  • Coding
  • Computational Complexity
  • Computations
  • Computer Programming
  • Computer Programs
  • Computers
  • Cryptography
  • Decoding
  • Number Theory
  • Numbers
  • Recognition
  • Secure Communications
  • Sequences
  • Simulators
  • Theorems

Fields of Study

  • Mathematics

Readers

  • Cybersecurity.
  • Mathematical Modeling and Probability Theory.
  • Systems Analysis and Design

Technology Areas

  • Cyber
  • Cyber - Cryptography