A Note on Cryptography and NPnCoNP-P,

Abstract

The use of the exponential function in a finite field for cryptographic purposes is studied. The proposal is based on the conjecture that the inverse function, the logarithm, is not feasibly computable. A proof of this conjecture would have important consequences for theoretical computer science, even under the assumption that P does not equal NP.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1978
Accession Number
ADA058801

Entities

People

  • Gilles Brassard
  • John Hopcroft
  • Steve Fortune

Organizations

  • Department of Computer Science, Cornell University

Tags

DTIC Thesaurus Topics

  • Computer Programming
  • Computer Science
  • Computers
  • Cryptography
  • Exponential Functions
  • Information Theory
  • Logarithm Functions
  • Military Research
  • New York
  • Polynomials
  • Theoretical Computer Science
  • Universities

Fields of Study

  • Computer science
  • Mathematics

Readers

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

Technology Areas

  • Cyber
  • Cyber - Cryptography