Author
Listed:
- ANDERSON GONÇALVES MARCO
(Universidade de São Paulo, Instituto de Ciências Matemáticas e de Computação, Av. do Trabalhador Sãocarlense 400, 13560-970 São Carlos, São Paulo, Brazil)
- ALEXANDRE SOUTO MARTINEZ
(Universidade de São Paulo, Faculdade de Filosofia Ciências e Letras de Ribeirão Preto, Av. Bandeirantes 3900, 14040-901 Ribeirão Preto, SP, Brazil;
National Institute of Science and Technology in Complex Systems, City, Brazil)
- ODEMIR MARTINEZ BRUNO
(Universidade de São Paulo, Instituto de Física de São Carlos, Av. do Trabalhador Sãocarlense 400, 13560-970 São Carlos, São Paulo, Brazil)
Abstract
A novel cryptography method based on the Lorenz's attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.
Suggested Citation
Anderson Gonçalves Marco & Alexandre Souto Martinez & Odemir Martinez Bruno, 2010.
"Fast, Parallel And Secure Cryptography Algorithm Using Lorenz'S Attractor,"
International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 21(03), pages 365-382.
Handle:
RePEc:wsi:ijmpcx:v:21:y:2010:i:03:n:s0129183110015166
DOI: 10.1142/S0129183110015166
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijmpcx:v:21:y:2010:i:03:n:s0129183110015166. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.