Lorenz’s attractor applied to the stream cipher (Ali-Pacha generator)

Adda Ali-Pacha, Naima Hadj-Said, M’Hamed, A. and A. Belgoraf

Chaos, Solitons & Fractals, 2007, vol. 33, issue 5, 1762-1766

Abstract: The safety of information is primarily founded today on the calculation of algorithms whose confidentiality depends on the number of the necessary bits for the definition of a cryptographic key. If this type of system has proved reliable, then the increasing power of the means of calculation threatens the confidentiality of these methods. The powerful computers are certainly able to quantify and decipher information quickly, but their computing speed allows parallel cryptanalysis, which aims “to break” a code by discovering the key, for example, by testing all the possible keys.

Date: 2007
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077906002360
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:33:y:2007:i:5:p:1762-1766

DOI: 10.1016/j.chaos.2006.03.009

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().