Domain Examination of Chaos Logistics Function As A Key Generator in Cryptography

Wowor, Alz Danny; Liwandouw, Vania Beatrice

doi:10.11591/ijece.v8i6.pp4577-4583

Cited by 2 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…is the symbol of the key and P = {p 1 , p 2 , • • • , p n } is the symbol of plaintext. Each k i ∈ K plays role as input to the examination scheme [28], and produces x 0 as the seed for the CSPRNG chaos function (F ).…”

Section: Implementation Of One-to-many Schemementioning

confidence: 99%

See 1 more Smart Citation

One to many (new scheme for symmetric cryptography)

Wowor

Susanto

2023

TELKOMNIKA

View full text Add to dashboard Cite

Symmetric cryptography will always produce the same ciphertext if the plaintext and the given key are the same repeatedly. This condition will make it easier for cryptanalysts to perform cryptanalysis. This research introduces a one-to-many cryptography scheme, which can produce different ciphertexts even if the input given is the same repeatedly. The one-to-many encryption scheme can produce several ciphertexts with differences of up to 50%. The avalanche effect test obtained an average of 52.20%, better than modern cryptography Blowfish by 25.46% and 6% better than advanced encryption standard (AES). One-to-many can produce different n-ciphertexts, which will certainly make it more difficult for cryptanalysts to perform cryptanalysis and require n-times longer to break than other symmetric cryptography.

show abstract

Section: Implementation Of One-to-many Schemementioning

confidence: 99%

“…The key generation starts from the examination process [28], each key input (k i ) and the index constant…”

Section: Key Generationmentioning

confidence: 99%

One to many (new scheme for symmetric cryptography)

Wowor

Susanto

2023

TELKOMNIKA

View full text Add to dashboard Cite

show abstract

“…The study trend has been transmitting from searching for the proofs of the existence of chaos into solicitations and thorough hypothetical research in past years [4]. Chaos arrangements got from a particular category of various equations are not sporadic and subtle to first circumstances, and it is hard to forecast their impending characters from previous annotations [5]. Because it is turning out that this chaotic system can be easily executed, most scholars in the systems and circuit of the nonlinear field have majorly been focused on creation execution concerning chaos.…”

Section: Introductionmentioning

confidence: 99%

Efficient error correcting scheme for chaos shift keying signals

Abdullah

Saeed

Sahar

2019

IJECE

View full text Add to dashboard Cite

An effective error-correction scheme based on normalized correlation for a non coherent chaos communication system with no redundancy bits is proposed in this paper. A modified logistic map is used in the proposed scheme for generating two sequences, one for every data bit value, in a manner that the initial value of the next chaotic sequence is set by the second value of the present chaotic sequence of the similar symbol. This arrangement, thus, has the creation of successive chaotic sequences with identical chaotic dynamics for error correction purpose. The detection symbol is performed prior to correction, on the basis of the suboptimal receiver which anchors on the computation of the shortest distance existing between the received sequence and the modified logistic map’s chaotic trajectory. The results of the simulation reveal noticeable Eb/No improvement by the proposed scheme over the prior to the error- correcting scheme with the improvement increasing whenever there is increase in the number of sequence N. Prior to the error-correcting scheme when N=8, a gain of 1.3 dB is accomplished in Eb/No at 10-3 bit error probability. On the basis of normalized correlation, the most efficient point in our proposed error correction scheme is the absence of any redundant bits needed with minimum delay procedure, in contrast to earlier method that was based on suboptimal method detection and correction. Such performance would render the scheme good candidate for applications requiring high rates of data transmission.

show abstract

Domain Examination of Chaos Logistics Function As A Key Generator in Cryptography

Cited by 2 publications

References 2 publications

One to many (new scheme for symmetric cryptography)

One to many (new scheme for symmetric cryptography)

Efficient error correcting scheme for chaos shift keying signals

Contact Info

Product

Resources

About