FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ'S ATTRACTOR

Author:

MARCO ANDERSON GONÇALVES1,MARTINEZ ALEXANDRE SOUTO23,BRUNO ODEMIR MARTINEZ4

Affiliation:

1. 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

2. 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

3. National Institute of Science and Technology in Complex Systems, City, Brazil

4. 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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computational Theory and Mathematics,Computer Science Applications,General Physics and Astronomy,Mathematical Physics,Statistical and Nonlinear Physics

Cited by 10 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3