Chaotic Rivest-Shamir-Adlerman Algorithm with Data Encryption Standard Scheduling

Arboleda, Edwin R.; Balaba, Joel L.; Espineli, John Carlo L.

doi:10.11591/eei.v6i3.627

Cited by 13 publications

(12 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is important to keep the prime numbers hidden. Anyone may use the public key to encode the data, conversely with current established approaches, if the public key is big enough, the message can only be decoded by someone who knows the prime numbers [10], [11]. The encryption and decryption procedure is described using the following pseudocode ().…”

Section: The Rsa Algorithmmentioning

confidence: 99%

A Note on Time and Space Complexity of RSA and ElGamal Cryptographic Algorithms

Adeniyi¹,

E²,

O³

et al. 2021

IJACSA

View full text Add to dashboard Cite

The computational complexity study of algorithms is highly germane to the design and development of high-speed computing devices. The whole essence of computation is principally influenced by efficiency of algorithms; this is more so the case with the algorithms whose solution space explodes exponentially. Cryptographic algorithms are good examples of such algorithms. The goal of this study is to compare the computational speeds of RSA and ElGamal cryptographic algorithms by carrying out a survey of works done so far by researchers. This study has therefore examined some of the results of the studies already done and highlighted which of the RSA and ElGamal algorithms performed better under given parameters. It is expected that this study would spur further investigation of the behaviour of cryptographic structures in order to ascertain their complexity and impact on the field of theoretical computer science. The experimental results of many of the papers reviewed showed that RSA cryptographic algorithm performs better as regards to energy usage, time complexity and space complexity of text, image and audio data during encryption process while some studies showed that ElGamal performs better in terms of time complexity during decryption process.

show abstract

Section: The Rsa Algorithmmentioning

confidence: 99%

A Note on Time and Space Complexity of RSA and ElGamal Cryptographic Algorithms

Adeniyi¹,

E²,

O³

et al. 2021

IJACSA

View full text Add to dashboard Cite

show abstract

“…The most significant concern with any current digital data is the privacy and security, for if they are breached, this will lead to compromise in their confidentiality and integrity [1]. Also, sharing on the data communication network is one of the main security challenge [2].…”

Section: Introductionmentioning

confidence: 99%

A new pseudorandom bits generator based on a 2D-chaotic system and diffusion property

Akif

Ali

et al. 2021

Bulletin EEI

View full text Add to dashboard Cite

A remarkable correlation between chaotic systems and cryptography has been established with sensitivity to initial states, unpredictability, and complex behaviors. In one development, stages of a chaotic stream cipher are applied to a discrete chaotic dynamic system for the generation of pseudorandom bits. Some of these generators are based on 1D chaotic map and others on 2D ones. In the current study, a pseudorandom bit generator (PRBG) based on a new 2D chaotic logistic map is proposed that runs side-by-side and commences from random independent initial states. The structure of the proposed model consists of the three components of a mouse input device, the proposed 2D chaotic system, and an initial permutation (IP) table. Statistical tests of the generated sequence of bits are investigated by applying five evaluations as well as the ACF and NIST. The results of five standard tests of randomness have been illustrated and overcome a value of 0.160 in frequency test. While the run test presents the pass value t0=4.769 and t1=2.929. Likewise, poker test and serial test the outcomes was passed with 3.520 for poker test, and 4.720 for serial test. Finally, autocorrelation test passed in all shift numbers from 1 to 10.

show abstract

“…Chaotic systems are applicable in a wide range of research classifications such as jerk systems [1,2], robotics [3,4], neuron models [5,6], oscillators [7,8], circuits [9][10][11], biological systems [12,13], chemical systems [14,15], and memristors [16,17]. In view of their attractive triangular structure, considerable numbers of papers have been published on the chaos jerk models [18][19][20].…”

Section: Introductionmentioning

confidence: 99%

A simple multi-stable chaotic jerk system with two saddle-foci equilibrium points: analysis, synchronization via backstepping technique and MultiSim circuit design

Sambas¹,

Vaidyanathan

Moroz

et al. 2021

IJECE

View full text Add to dashboard Cite

<span>This paper announces a new three-dimensional chaotic jerk system with two saddle-focus equilibrium points and gives a dynamic analysis of the properties of the jerk system such as Lyapunov exponents, phase portraits, Kaplan-Yorke dimension and equilibrium points. By modifying the Genesio-Tesi jerk dynamics (1992), a new jerk system is derived in this research study. The new jerk model is equipped with multistability and dissipative chaos with two saddle-foci equilibrium points. By invoking backstepping technique, new results for synchronizing chaos between the proposed jerk models are successfully yielded. MultiSim software is used to implement a circuit model for the new jerk dynamics. A good qualitative agreement has been shown between the MATLAB simulations of the theoretical chaotic jerk model and the MultiSIM results</span>

show abstract

Chaotic Rivest-Shamir-Adlerman Algorithm with Data Encryption Standard Scheduling

Cited by 13 publications

References 18 publications

A Note on Time and Space Complexity of RSA and ElGamal Cryptographic Algorithms

A Note on Time and Space Complexity of RSA and ElGamal Cryptographic Algorithms

A new pseudorandom bits generator based on a 2D-chaotic system and diffusion property

A simple multi-stable chaotic jerk system with two saddle-foci equilibrium points: analysis, synchronization via backstepping technique and MultiSim circuit design

Contact Info

Product

Resources

About