• DocumentCode
    929777
  • Title

    A note on the complexity of cryptography (Corresp.)

  • Author

    Brassard, Gilles

  • Volume
    25
  • Issue
    2
  • fYear
    1979
  • fDate
    3/1/1979 12:00:00 AM
  • Firstpage
    232
  • Lastpage
    233
  • Abstract
    Evidence is given for the difficulty of an eventual proof of computational security for cryptosystems based on one-way functions, such as the one proposed by Diffie and Hellman. A proof of NP-completeness for the cryptanalytic effort would imply NP=CoNP.
  • Keywords
    Computation theory; Cryptography; Computational modeling; Computer science; Cryptography; Galois fields; Polynomials; Proposals; Security; Terrorism; Turing machines;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1979.1056010
  • Filename
    1056010
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=929777