Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 30 June 2007

A Different Text Attack Algorithm in Integer Factoring Based Schemes

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

Journal of Computer Science, Volume 3, Issue 6, pp. 406–409 · doi.org/10.3844/jcssp.2007.406.409

6,654 accesses4,350 downloads0 citations (Crossref)Metrics
Cite Check for updates

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.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2007 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

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

Licence
© Science Publications
Issue
Volume 3, Issue 6
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
A Different Text Attack Algorithm in Integer Factoring Based SchemesJournal of Computer Science · Volume 3, Issue 6 · pp. 406–409 · © Science PublicationsDownload