• DocumentCode
    3158265
  • Title

    The additional result over the work of Blomer and May

  • Author

    Ojha, Navaneet ; Padhye, Sahadeo

  • Author_Institution
    Dept. of Math., Motilal Nehru Nat. Inst. of Technol., Allahabad, India
  • fYear
    2010
  • fDate
    17-19 Sept. 2010
  • Firstpage
    75
  • Lastpage
    80
  • Abstract
    In this paper we improve the range of weak keys of RSA cryptosystem for the Generalized Wiener´s attack given by Blomer & May. We have shown that the range of weak keys can be extended by more than 8 times than the range given by Blomer & May. Further we have shown that for some special condition, N can be factored in (O poly(log N)) time.
  • Keywords
    computational complexity; public key cryptography; Blomer & May; RSA cryptosystem; generalized Wiener attack; Artificial neural networks; Communications technology; Computers; Polynomials; Public key; Continued fractions; Coppersmith´s method; RSA; Wiener´s attack;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer and Communication Technology (ICCCT), 2010 International Conference on
  • Conference_Location
    Allahabad, Uttar Pradesh
  • Print_ISBN
    978-1-4244-9033-2
  • Type

    conf

  • DOI
    10.1109/ICCCT.2010.5640387
  • Filename
    5640387