• DocumentCode
    832949
  • Title

    M mod 3 security of RSA

  • Author

    Kurosawa, K. ; Matsu, K.

  • Author_Institution
    Tokyo Inst. of Technol., Yokohama, Japan
  • Volume
    25
  • Issue
    7
  • fYear
    1989
  • fDate
    3/30/1989 12:00:00 AM
  • Firstpage
    445
  • Lastpage
    446
  • Abstract
    The letter shows that guessing M and 3 with probability 1/3+1/poly (n) is equivalent to breaking the RSA, where M is the plaintext. A simple technique is developed instead of the modified binary gcd.<>
  • Keywords
    codes; cryptography; information theory; M mod 3 security; RSA; modified binary gcd; public key cryptosystem; Codes; Cryptography; Information theory;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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