Erratum to: A Nonlinear Generalization of Singular Value Decomposition and Its Applications to Mathematical Modeling and Chaotic Cryptanalysis (original) (raw)
2010, Acta applicandae mathematicae
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
Unfortunately a few errors were left uncorrected during the proof process of this paper. They are listed here:
Related papers
Singular-value decomposition in attractor reconstruction: pitfalls and precautions
Physica D Nonlinear Phenomena, 1992
Applicability of singular-value decomposition for reconstructing the strange attractor from one-dimensional chaotic time series, proposed by Broomhead and King, is extensively tested and discussed. Previously published doubts about its reliability are confirmed: singular-value decomposition, by nature a linear method, can bring distorted and misleading results when nonlinear structures are studied.
Cryptanalysis of a cryptosystem based on discretized two-dimensional chaotic maps
Physics Letters A, 2008
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: http://www.elsevier.com/copyright
A basic framework for the cryptanalysis of digital chaos-based cryptography
Systems, Signals and …, 2009
Chaotic cryptography is based on the properties of chaos as source of entropy. Many different schemes have been proposed to take advantage of those properties and to design new strategies to encrypt information. However, the right and efficient use of chaos in the context of cryptography requires a thorough knowledge about the dynamics of the selected chaotic system. Indeed, if the final encryption system reveals enough information about the underlying chaotic system it could be possible for a cryptanalyst to get the key, part of the key or some information somehow equivalent to the key just analyzing those dynamical properties leaked by the cryptosystem. This paper shows what those dynamical properties are and how a cryptanalyst can use them to prove the inadequacy of an encryption system for the secure exchange of information. This study is performed through the introduction of a series of mathematical tools which should be the basic framework of cryptanalysis in the context of digital chaos-based cryptography.
Chaotic Equations Initial Conditions Analysis for Cryptography Applications
Anais do XXVII Simpósio Brasileiro de Telecomunicações, 2009
-Nesta última década, muitos artigos em que equac ¸ões caóticas são usadas como a ideia central em algoritmos criptográficos surgiram. Embora muitos destes algoritmos usem as Condic ¸ões Iniciais (IC) de equac ¸ões diferenciais caóticas como chave criptográfica, um estudo preciso das ICs válidas (aquelas que conduzem ao caos) não foi realizado. Neste artigo, é analisada a equac ¸ão diferencial caótica mais elementar, descoberta por Linz e Sprott, com o objetivo de determinar V IC (a região de Condic ¸ões Iniciais Válidas) e a sua importância na determinac ¸ão do espac ¸o de chaves para algoritmos criptográficos baseados em caos. Palavras-Chave-Caos, criptografia, fluxo caótico, condic ¸ões iniciais, atrator, espac ¸o de chaves criptográficas.
Cryptanalytic methods in chaotic cryptosystems
6 pages, 6 figures.-- Communication presented at the 5th World Multiconference on Systemics, Cybernetics and Informatics and 7th International Conference on Information System Analysis and Synthesis (SCI/ISAS 2001, Orlando, Florida, Jul 22-25, 2001). In recent years, telecommunications networks have undergone an explosive growth. As a consequence, there has been a strong demand of information protection mechanisms. Many cryptosystems based on chaos have been proposed, although little or no critical analysis has been made about the security and cryptographic robustness of these algorithms. In this paper we present our tools to examine some of these algorithms from a cryptographic perspective, showing many vulnerabilities that can be exploited to successfully break them. We conclude that most of the chaotic cryptosystems are very insecure and cumbersome, thus, unreliable and impractical for real applications. Peer reviewed
Some hints for the design of digital chaos-based cryptosystems: lessons learned from cryptanalysis
Arxiv preprint arXiv:0812.0765, 2008
In this work we comment some conclusions derived from the analysis of recent proposals in the field of chaos-based cryptography. These observations remark a number of major problems detected in some of those schemes under examination. Therefore, this paper is a list of what to avoid and to pay special attention to when considering chaos as source of new strategies to conceal and protect information.
Chaotic cryptosystems: Cryptanalysis and identifiability
Circuits and Systems I: …, 2006
A general framework and a systematic methodology for the cryptanalysis of a large class of chaotic cryptosystems are proposed. More precisely, it is tested, a priori, during the design stage, whether the parameters of a chaotic cryptosystem may play the role of the secret key or not. Robustness against brute force attacks is first considered. A connection between uniqueness in the parameters and identifiability is pointed out. Two approaches, the outputs equality approach and the input/output relation approach, are presented to test the identifiability of the system parameters. The second approach is constructive in the sense that not only it allows to conclude on the identifiability of the parameters but it also provides a systematic technique to retrieve the parameters in the context of a known plaintext attack. It is shown that cryptosystems involving polynomial nonlinearities, chaotic or not, are weak against this attack, called algebraic attack.
Chaos-based cryptography: a brief overview
Circuits and Systems Magazine, IEEE, 2001
In this brief article, chaosbased cryptography is discussed from a point of view which I believe is closer to the spirit of both cryptography and chaos theory than the way the subject has been treated recently by many researchers. I hope that, although this paper raises more questions than provides answers, it nevertheless contains seeds for future work.
Encryption using Deterministic Chaos
The concepts of randomness, unpredictability, complexity and entropy form the basis of modern cryptography and a cryptosystem can be interpreted as the design of a key-dependent bijective transformation that is unpredictable to an observer for a given computational resource. For any cryptosystem, including a Pseudo-Random Number Generator (PRNG), encryption algorithm or a key exchange scheme, for example, a cryptanalyst has access to the time series of a dynamic system and knows the PRNG function (the algorithm that is assumed to be based on some iterative process) which is taken to be in the public domain by virtue of the Kerchhoff-Shannon principal, i.e. the enemy knows the system. However, the time series is not a compact subset of a trajectory (intermediate states are hidden) and the iteration function is taken to include a 'secret parameter'-the 'key'. We can think of the sample as being 'random', 'unpredictable' and 'complex'. What do these properties mean mathematically and how do they relate to chaos? This paper focuses on answers to this question, links these properties to chaotic dynamics and consider the issues associated with designing pseudo-random number generators based on chaotic systems. The theoretical backound associated with using chaos for encryption is introduced with regard to randomness and complexity. A complexity and information theortic approach is considered based on a study of the complexity and entropy measures associated with chaotic systems. A study of pseudorandomness is then given which provides the foundations for the numerical methods that need to be realed for the practical implementation of data encryption. We study cryptographic systems using finite-state approximations to chaos or 'pseudochaos' and develop an approach based on the concept of multialgorithmic cryptography that exploits the properties of pseudochaotic algorithms.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
Related papers
Acta applicandae mathematicae, 2010
Singular Value Decomposition (SVD) is a powerful tool in linear algebra and has been extensively applied to Signal Processing, Statistical Analysis and Mathematical Modeling. We propose an extension of SVD for both the qualitative detection and quantitative determination of nonlinearity in a time series. The method is to augment the embedding matrix with additional nonlinear columns derived from the initial embedding vectors and extract the nonlinear relationship using SVD. The paper demonstrates an application of nonlinear SVD to identify parameters when the signal is generated by a nonlinear transformation. Examples of maps (Logistic map and Henon map) and flows (Van der Pol oscillator and Duffing oscillator) are used to illustrate the method of nonlinear SVD to identify parameters. The paper presents the recovery of parameters in the following scenarios: (i) data generated by maps and flows, (ii) comparison of the method for both noisy and noise-free data, (iii) surrogate data analysis for both the noisy and noise-free cases. The paper includes two applications of the method: (i) Mathematical Modeling and (ii) Chaotic Cryptanalysis.
A Non-linear Generalization of Singular Value Decomposition and its Application to Cryptanalysis
2007
Singular Value Decomposition (SVD) is a powerful tool in linear algebra and has been extensively applied to Signal Processing, Statistical Analysis and Mathematical Modeling. We propose an extension of SVD for both the qualitative detection and quantitative determination of nonlinearity in a time series. The paper illustrates nonlinear SVD with the help of data generated from nonlinear maps and flows (differential equations). The method is to augment the embedding matrix with additional nonlinear columns derived from the initial embedding vectors and extract the nonlinear relationship using SVD. The paper also demonstrates an application of nonlinear SVD to cryptanalysis where the encrypted signal is generated by a nonlinear transformation. A comparison of the method for both noise-free and noisy data along with their surrogate counterparts is included.
Singular value decomposition to determine the dynamics of a chaotic regime oscillator
2019
Targeting the hybrid analog-digital private communication field, this paper aims to estimate the parameters of an analog circuit model. An oscilloscope stores the samples of a voltage in a.csv file. The data series is processed using a digital signal technique the singular value decomposition. Singular values and corresponding right-eigenvectors are used to estimated the values of the parameters of the model characterizing the circuit that produced the measured output. The decomposition is performed using small windows of samples of the output of a jerk-type circuit from the literature and an averaging operation improves the estimation.
Lessons Learnt from the Cryptanalysis of Chaos-Based Ciphers
Chaos-Based Cryptography, 2011
The idea of using chaotic transformations in cryptography is explicit in the foundational papers of Shannon on secrecy systems (e.g., [96]). Although the word “chaos” was not minted till the 1970s [71], Shannon clearly refers to this very concept when he proposes the construction of secure ciphers by means of measure-preserving, mixing maps which depend ‘sensitively’ on their parameters. The implementation of Shannon’s intuitions had to wait till the development of Chaos Theory in the 1980s. Indeed, it was around 1990 when the first chaos-based ciphers were proposed (e.g., [78], [46]). Moreover, in 1990 chaos synchronization [91] entered the scene and shortly thereafter, the first applications to secure communications followed [56, 37]. The idea is remarkably simple: mask the message with a chaotic signal and use synchronization at the receiver to filter out the chaotic signal. The realization though had to overcome the desynchronization induced by the message itself. After this initial stage, the number of proposals which exploited the properties of chaotic maps for cryptographical purposes, grew in a spectacular way.
Cryptanalysis of a chaotic encryption system
Physics Letters A, 2000
Recently a new chaotic encryption system has been proposed by E. Alvarez et al. In this paper, several weaknesses of this cryptosystem are pointed out and four successful cryptanalytic attacks are described.
Iterative SVD method for noise reduction of low-dimensional chaotic time series
Mechanical Systems and Signal Processing, 1999
A new simple method using singular value decomposition (SVD) is presented for reducing noise from a sampled signal where the deterministic signal is from a low-dimensional chaotic dynamical system. The technique is concerned particularly with improving the reconstruction of the phase portrait. This method is based on time delay embedding theory to form a trajectory matrix. SVD is then used iteratively to distinguish the deterministic signal from the noise. Under certain conditions, the method can be used almost blindly, even in the case of a very noisy signal (e.g. a signal to noise ratio of 6 dB). The algorithm is evaluated for a chaotic signal generated by the Duffing system, to which white noise is added.
Communications in Nonlinear Science and Numerical Simulation, 2010
This paper describes a method about how to determine parameters of some double-scroll chaotic systems, including the Lorenz system and the Chua's circuit, from one of its variables. The geometric properties of the system are exploited firstly to reduce the parameter search space. Then, a synchronization-based approach, with the help of the same geometric properties as coincidence criteria, is implemented to determine the parameter values with the wanted accuracy. The method is not affected by a moderate amount of noise in the waveform. As an example of its effectiveness, the method is applied to cryptanalyze two two-channel chaotic cryptosystems, figuring out how the secret keys can be directly derived from the driving signal z(t).
SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
International Journal of Bifurcation and Chaos, 2006
In recent years, a large amount of work on chaos-based cryptosystems have been published. However many of the proposed schemes fail to explain or do not possess a number of features that are fundamentally important to all kind of cryptosystems. As a result, many proposed systems are difficult to implement in practice with a reasonable degree of security. Likewise, they are seldom accompanied by a thorough security analysis. Consequently, it is difficult for other researchers and end users to evaluate their security and performance. This work is intended to provide a common framework of basic guidelines that, if followed, every new cryptosystem would benefit from. The suggested guidelines address three main issues: implementation, key management, and security analysis, aiming at assisting designers of new cryptosystems to present their work in a more systematic and rigorous way to fulfill some basic cryptographic requirements. Meanwhile, several recommendations are made regarding some practical aspects of analog chaos-based secure communications, such as channel noise, limited bandwith, and attenuation.