JCS Cover
Frequency: Monthly
ISSN: 1549-3636 (Print)
ISSN: 1552-6607 (Online)
Research Article Open Access

A Different Text Attack Algorithm in Integer Factoring Based Schemes

Mohammed A. AL-Fayoumi, Sattar J. Aboud and Musbah M. Aqel

Abstract

Text attack in integer factoring based schemes is generally calculated as an intrinsic characteristic of its symmetric attack. In this article, we illustrate that asymmetric integer factoring based schemes are also vulnerable to a text attack. Also, we show that a single message is required to increase a successful text attack versus the Lucas scheme.

Journal of Computer Science
Volume 3 No. 6, 2007, 406-409

DOI: https://doi.org/10.3844/jcssp.2007.406.409

Submitted On: 16 March 2007 Published On: 30 June 2007

How to Cite: AL-Fayoumi, M. A., Aboud, S. J. & Aqel, M. M. (2007). A Different Text Attack Algorithm in Integer Factoring Based Schemes. Journal of Computer Science, 3(6), 406-409. https://doi.org/10.3844/jcssp.2007.406.409

Open AccessCopyright: © 2007 Mohammed A. AL-Fayoumi, Sattar J. Aboud and Musbah M. Aqel. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

  • 3,330 Views
  • 2,370 Downloads
  • 0 Citations

Download

Keywords

  • Integer factoring schemes
  • RSA scheme
  • Lucas scheme
  • text attack