Public Key Cryptographic System Using Mandelbrot Sets

Kumar, Suthikshn

doi:10.1109/milcom.2006.302396

Cited by 23 publications

(16 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a part of that, uses two phases that are encrypt the data by using sierpinski sieve fractal algorithm [9,10,11] as described in the section 3.1 to get the ciphertext (Enc i ) and immediately find the message digest to either original data or encrypted data by using MMD hash algorithm [7] H(d) as mentioned in 3.2. The ciphertext and message digest should be participated in the communication from the seder side.…”

Section: Proposed Methodsmentioning

confidence: 99%

“…Based on the keys, the transformation of the plain text is passed out to achieve the cipher text. Both the sender and receiver share the same key so this is symmetric encryption and is normally called as fractal symmetric encryption [9]. First of all the inner triangles are filled with secret key, then the outer triangles are filled with plain text as shown in Fig 1[2, 20].…”

Section: Symmetric Key Encryption Using Fractal Geometrymentioning

confidence: 99%

See 1 more Smart Citation

Performance Evaluation of Message Security Using Fractal Sieve with MMD

Rupa¹

2013

IJSPTM

View full text Add to dashboard Cite

show abstract

Section: Proposed Methodsmentioning

confidence: 99%

Section: Symmetric Key Encryption Using Fractal Geometrymentioning

confidence: 99%

Performance Evaluation of Message Security Using Fractal Sieve with MMD

Rupa¹

2013

IJSPTM

View full text Add to dashboard Cite

show abstract

“…A more detailed review of the topics are as in (Barnsley, 2000;Kumar, 2006). The theory of fractal sets is a modern domain of research.…”

Section: Methodsmentioning

confidence: 99%

“…Since then many studies on a new key agreement protocol based on chaotic maps were undertaken (Gonzalo, 2005;Yoon and Yoo, 2008). There were also proposals for incorporating fractal functions into the design of symmetric and asymmetric encryption schemes using the similar mechanism (Ahmad and Samsudin, 2007;Ali and Ahmad, 2008;Kumar, 2006). However though many of the proposed schemes have several advantages such as computational efficiency, ease of generating public-private key pairs, they fail to explain or do not possess a number of features that are fundamentally important to all kinds of cryptosystems.…”

Section: Introductionmentioning

confidence: 99%

Efficiency Analysis for Public Key Systems Based on Fractal Functions

AL-Saidi¹

2011

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement:In the last decade, dynamical systems were utilized to develop cryptosystems, which ushered the era of continuous value cryptography that transformed the practical region from finite field to real numbers. Approach: Taking the security threats and privacy issues into consideration, fractals functions were incorporated into public-key cryptosystem due to their complicated mathematical structure and deterministic nature that meet the cryptographic requirements. In this study we propose a new public key cryptosystem based on Iterated Function Systems (IFS). Results: In the proposed protocol, the attractor of the IFS is used to obtain public key from private one, which is then used with the attractor again to encrypt and decrypt the messages. By exchanging the generated public keys using one of the well known key exchange protocols, both parties can calculate a unique shared key. This is used as a number of iteration to generate the fractal attractor and mask the Hutchinson operator, so that, the known attacks will not work anymore. Conclusion: The algorithm is implemented and compared to the classical one, to verify its efficiency and security. We conclude that public key systems based on IFS transformation perform more efficiently than RSA cryptosystems in terms of key size and key space.

show abstract

“…The fractals generate infinitely complex patterns and show repetition and self-similarity at different scales. It is the repeating process of images and is familiar patterns since the whole universe consists of fractals in different forms [30][31][32][33][34][35][36][37][38][39][40][41][42][43]. In this context, we have designed a cryptosystem based on shuffling with Julia set of fractals key and chaos theory.…”

mentioning

confidence: 99%

A Novel Hybrid Secure Image Encryption Based on Julia Set of Fractals and 3D Lorenz Chaotic Map

Masood

Ahmad

Shah

et al. 2020

Entropy

111

View full text Add to dashboard Cite

Chaos-based encryption schemes have attracted many researchers around the world in the digital image security domain. Digital images can be secured using existing chaotic maps, multiple chaotic maps, and several other hybrid dynamic systems that enhance the non-linearity of digital images. The combined property of confusion and diffusion was introduced by Claude Shannon which can be employed for digital image security. In this paper, we proposed a novel system that is computationally less expensive and provided a higher level of security. The system is based on a shuffling process with fractals key along with three-dimensional Lorenz chaotic map. The shuffling process added the confusion property and the pixels of the standard image is shuffled. Three-dimensional Lorenz chaotic map is used for a diffusion process which distorted all pixels of the image. In the statistical security test, means square error (MSE) evaluated error value was greater than the average value of 10000 for all standard images. The value of peak signal to noise (PSNR) was 7.69(dB) for the test image. Moreover, the calculated correlation coefficient values for each direction of the encrypted images was less than zero with a number of pixel change rate (NPCR) higher than 99%. During the security test, the entropy values were more than 7.9 for each grey channel which is almost equal to the ideal value of 8 for an 8-bit system. Numerous security tests and low computational complexity tests validate the security, robustness, and real-time implementation of the presented scheme.Entropy 2020, 22, 274 2 of 28 scientist Claude Shannon in the year 1949, the same person introduced the property of confusion and diffusion. The property of randomness helped in securing digital multimedia information. The security of digital bitstream became one of the central issues when the data was transformed into a digital bitstream. The privacy of digital information posed a new problem in the digital world. The secure digital data in the form of binary bits are openly accessible for hackers. The data can be easily obtainable from the far site using the internet. It needs proper measurements to secure digital information over an insecure line of communication [1][2][3]. The digital data can be secured by hiding the identity of the original digital image over the secret cover image or another approach is pixels distortion or encryption. The first method of securing digital information is information hiding techniques and the study of steganography, which means the value of the data is preserved under the secret image. The image security is a very important issue as compared to textual security, where image pixels are to be examined concerning nearby pixels in a different orientation. The more pixels are dissimilar means the proposed encryption technique is more suitable for brute force attacks. Moreover, plain image pixels are always correlated to each other where an attacker can easily find secret information. Chaos-based encryption technique is preferred over some ...

show abstract

Public Key Cryptographic System Using Mandelbrot Sets

Cited by 23 publications

References 5 publications

Performance Evaluation of Message Security Using Fractal Sieve with MMD

Performance Evaluation of Message Security Using Fractal Sieve with MMD

Efficiency Analysis for Public Key Systems Based on Fractal Functions

A Novel Hybrid Secure Image Encryption Based on Julia Set of Fractals and 3D Lorenz Chaotic Map

Contact Info

Product

Resources

About