• DocumentCode
    3645515
  • Title

    Attacks on the RSA cryptosystem using integer factorization

  • Author

    Jelena M. Smiljanić;Predrag N. Ivaniš

  • Author_Institution
    Elektrotehnicki fakultet u Beogradu, Belgrade, Serbia
  • fYear
    2011
  • Firstpage
    550
  • Lastpage
    553
  • Abstract
    This paper describes how integer factorization algorithms may be used to break the RSA cryptosystem. Complexity and efficiency of Trial division, Lehman´s method, Pollard´s ρ method and Quadratic Sieve algorithm are analyzed. The corresponding numerical results are presented for typical secret key lengths.
  • Keywords
    "Cryptography","Algorithm design and analysis","Complexity theory","Sockets","Polynomials","Telecommunications"
  • Publisher
    ieee
  • Conference_Titel
    Telecommunications Forum (TELFOR), 2011 19th
  • Print_ISBN
    978-1-4577-1499-3
  • Type

    conf

  • DOI
    10.1109/TELFOR.2011.6143608
  • Filename
    6143608
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3645515