arXiv 0806.31832008-06-19nlin.CD

Cryptanalysis of a new chaotic cryptosystem based on ergodicity

David Arroyo, Gonzalo Alvarez, Shujun Li, Chengqing Li, Veronica Fernandez

备注：: 10 pages, 5 figures
DOI：: 10.1142/S0217979209049966

英文摘要：

This paper analyzes the security of a recent cryptosystem based on the ergodicity property of chaotic maps. It is shown how to obtain the secret key using a chosen-ciphertext attack. Some other design weaknesses are also shown.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Cryptanalysis of a novel cryptosystem based on chaotic oscillators and feedback inversion

An analysis of a recently proposed cryptosystem based on chaotic oscillators and feedback inversion is presented. It is shown how the cryptosystem can be broken when Duffing's oscillator is considered. Some implementation problems of the system are also discussed.

2003-11-20nlin.CD

Cryptanalysis of dynamic look-up table based chaotic cryptosystems

In recent years many chaotic cryptosystems based on Baptista's seminal work have been proposed. We analyze the security of two of the newest and most interesting ones, which use a dynamically updated look-up table and also work as stream ciphers. We provide different attack techniques to recover the keystream used by the algorithms. The knowledge of this keystream provides the attacker with the same information as the key and thus the security is broken. We also show that the dependence on the plaintext, and not on the key, of the look-up table updating mechanism facilitates cryptanalysis.

2003-11-20nlin.CD

Some hints for the design of digital chaos-based cryptosystems: lessons learned from cryptanalysis

In this work we comment some conclusions derived from the analysis of recent proposals on the field of chaos-based cryptography. These observations remark the main problems detected in some of those schemes under examination. Therefore, this paper is a list of what to avoid when considering chaos as source of new strategies to conceal and protect information.

2008-12-03nlin.AOnlin.CD

Exploiting ergodicity of the logistic map using deep-zoom to improve security of chaos-based cryptosystems

This paper explores the deep-zoom properties of the chaotic k-logistic map, in order to propose an improved chaos-based cryptosystem. This map was shown to enhance the random features of the Logistic map, while at the same time reducing the predictability about its orbits. We incorporate its strengths to security into a previously published cryptosystem to provide an optimal pseudo-random number generator (PRNG) as its core operation. The result is a reliable method that does not have the weaknesses previously reported about the original cryptosystem.

2018-09-12cs.CRnlin.CD

Differential-like Chosen Cipher Attack on A Spatiotemporally Chaotic Cryptosystem

The combinative applications of one-way coupled map lattice (OCML) and some simple algebraic operations have demonstrated to be able to construct the best known chaotic cryptosystem with high practical security, fast encryption speed, and excellent robustness against channel noise. In this paper, we propose a differential-like chosen cipher attack to break the prototypical system cooperating with INT and MOD operations. This cryptographic method exploits the weakness that the high-dimensional cryptosystem degenerates to be one-dimensional under constant driving, therefore, is no more sensitive…

2005-06-11nlin.CD

On the security of a new image encryption scheme based on chaotic map lattices

This paper reports a detailed cryptanalysis of a recently proposed encryption scheme based on the logistic map. Some problems are emphasized concerning the key space definition and the implementation of the cryptosystem using floating-point operations. It is also shown how it is possible to reduce considerably the key space through a ciphertext-only attack. Moreover, a timing attack allows the estimation of part of the key due to the existent relationship between this part of the key and the encryption/decryption time. As a result, the main features of the cryptosystem do not satisfy the deman…

2008-04-14nlin.CD

更多相关论文收起更多论文

Cryptanalysis of a one round chaos-based Substitution Permutation Network

The interleaving of chaos and cryptography has been the aim of a large set of works since the beginning of the nineties. Many encryption proposals have been introduced to improve conventional cryptography. However, many proposals possess serious problems according to the basic requirements for the secure exchange of information. In this paper we highlight some of the main problems of chaotic cryptography by means of the analysis of a very recent chaotic cryptosystem based on a one round Substitution Permutation Network. More specifically, we show that it is not possible to avoid the security p…

2012-04-02cs.CRnlin.CD

Chaotic Cryptographic Scheme Based on Composition Maps

In recent years, a growing number of cryptosystems based on chaos have been proposed. But most of them encountered many problems such as small key space and weak security. In the present paper, a new kind of chaotic cryptosystem based on Composition of Trigonometric Chaotic Maps is proposed. These maps which are defined as ratios of polynomials of degree N, have interesting properties such as invariant measure, ergodicity, variable chaotic region with respect to the control parameters and ability to construct composition form of maps. We have used a composition of chaotic map to shuffle the po…

2006-06-27nlin.CD