• DocumentCode
    2530889
  • Title

    The security of individual RSA bits

  • Author

    Håstad, Johan ; Näslund, Mats

  • Author_Institution
    NADA, R. Inst. of Technol., Stockholm, Sweden
  • fYear
    1998
  • fDate
    8-11 Nov 1998
  • Firstpage
    510
  • Lastpage
    519
  • Abstract
    We study the security of individual bits in an RSA encrypted message EN(X). We show that given EN(X), predicting any single bit in x with only a non-negligible advantage over the trivial guessing strategy is (through a polynomial time reduction) as hard as breaking RSA. We briefly discuss a related result for bit security of the discrete logarithm
  • Keywords
    cryptography; RSA encrypted message; bit security; discrete logarithm; individual RSA bits security; polynomial time reduction; trivial guessing strategy; Cryptography; Electronic mail; Information analysis; Information security; Jacobian matrices; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1998. Proceedings. 39th Annual Symposium on
  • Conference_Location
    Palo Alto, CA
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-9172-7
  • Type

    conf

  • DOI
    10.1109/SFCS.1998.743502
  • Filename
    743502
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2530889