• DocumentCode
    1023188
  • Title

    Fast public-key cryptosystem using congruent polynomial equations

  • Author

    Okamoto, Tatsuaki

  • Author_Institution
    NTT Electrical Communications Laboratories, Yokosuka, Japan
  • Volume
    22
  • Issue
    11
  • fYear
    1986
  • Firstpage
    581
  • Lastpage
    582
  • Abstract
    A fast public-key cryptosystem is proposed which is based on congruent polynomial equations. This scheme is much faster than the RSA scheme. Moreover, the encryption and decyption algorithms for this scheme are very simple. The task of breaking this scheme appears to be as difficult as that of factoring a large composite integer, although this has not yet been proven.
  • Keywords
    cryptography; information theory; breaking difficulty; congruent polynomial equations; decryption algorithms; encryption; fast public-key cryptosystem;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19860395
  • Filename
    4256591
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1023188