Decoding chaotic cryptography without access to the superkey

Vaidya, Prabhakar G and Angadi, Savita (2003) Decoding chaotic cryptography without access to the superkey. Chaos, Solitons & Fractals, 17 (2-3). pp. 379-386.

Full text not available from this repository.
ContributionNameEmail
Abstract: Some chaotic systems can be synchronized by sending only a part of the state space information. This property is used to create keys for cryptography using the unsent state spaces. This idea was first used in connection with the Lorenz equation. It has been assumed for that equation that access to the unsent information is impossible without knowing the three parameters of the equation. This is why the values of these parameters are collectively known as the “superkey”. The exhaustive search for this key from the existing data is time consuming and can easily be countered by changing the key. We show in this paper how the superkey can be found in a very rapid manner from the synchronizing signal. We achieve this by first transforming the Lorenz equation to a canonical form. Then we use our recently developed method to find highly accurate derivatives from data. Next we transform a nonlinear equation for the superkey to a linear form by embedding it in four dimensions. The final equations are solved by using the generalized inverse.
Item Type: Article
Keywords: chaotic cryptography, superkey
Subjects: School of Natural and Engineering Sciences > Mathematical Modeling
Doctoral Programme > PhD Scholar Publications
Date Deposited: 13 Jun 2021 17:04
Last Modified: 13 Jun 2021 17:04
Official URL: https://www.sciencedirect.com/science/article/abs/...
Related URLs:
    Funders: UNSPECIFIED
    Projects: UNSPECIFIED
    DOI: https://doi.org/10.1016/S0960-0779(02)00377-6
    URI: http://eprints.nias.res.in/id/eprint/2112

    Actions (login required)

    View Item View Item