A Parallel Encryption Algorithm Based on Piecewise Linear Chaotic Map

Wang, Xizhong; Chen, Deyun

doi:10.1155/2013/537934

Cited by 14 publications

(15 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Performance of the proposed chaotic algorithm(CET-2C) is measured, and finally compared with the existing one secret key, AES, encryption algorithm and also compared with different algorithms using same data size published in Springer [12], Hindawi [17] and EEA [3] publications. It is to be shown that CET-2C is not affected by the data set, and only depends upon the data size.…”

Section: Performance Analysismentioning

confidence: 99%

“…The performance of the proposed algorithm (CET-2C) is compared with a popular secret key encryption algorithm, AES, and with Chaotic Algorithms [3,12] using the data size same as provided in [3,12,17]. The plaintexts used in the proposed algorithm, are encrypted using AES, and a Chaotic Algorithm [3,12] and their performance is evaluated and analyzed using the same metrics as above.…”

Section: Comparison With Aes and Chaotic Algorithms [3]mentioning

confidence: 99%

“…The data sizes was also taken in bytes and experiments performed to calculate the encryption time using a laptop with an Intel (R) Core (TM) i3-3110M processor @ 2.40GHzCPU, and a RAM of 2GB (Table 11). Figure 7 shows that for small dataset sizes (100 KB and 500 KB) the comparison algorithms [17] performed the encryption with slightly higher speed, but for large data sizes (larger than 500 KB) the encryption time is instantly increased. The graph of our proposed algorithm CET-2C increased linearly for small to large data sizes.…”

Section: Message Sizes In Mb Encryption Time In Millisecondsmentioning

confidence: 99%

“…Compared Algorithm1 [17] Compared Algorithm2 [17] CET-2C Figure 7. Encryption times of compared Algorithms 1 and 2 [17] and CET-2C.…”

Section: Encryption Timementioning

confidence: 99%

“…Encryption times of compared Algorithms 1 and 2 [17] and CET-2C. Table 12 illustrates that the overall gain % of CET-2C for encryption time is negative as compared with the compared Algorithms 1 and 2 [17] for small data sizes (up to 500 KB), meaning that CET-2C takes a longer time for encryption.…”

Section: Encryption Timementioning

confidence: 99%

See 4 more Smart Citations

An Intelligent and Fast Chaotic Encryption Using Digital Logic Circuits for Ad-Hoc and Ubiquitous Computing

Khare

Shukla

Rizvi

et al. 2016

Entropy

View full text Add to dashboard Cite

Abstract:Delays added by the encryption process represent an overhead for smart computing devices in ad-hoc and ubiquitous computing intelligent systems. Digital Logic Circuits are faster than other computing techniques, so these can be used for fast encryption to minimize processing delays. Chaotic Encryption is more attack-resilient than other encryption techniques. One of the most attractive properties of cryptography is known as an avalanche effect, in which two different keys produce distinct cipher text for the same information. Important properties of chaotic systems are sensitivity to initial conditions and nonlinearity, which makes two similar keys that generate different cipher text a source of confusion. In this paper a novel fast and secure Chaotic Map-based encryption technique using 2's Compliment (CET-2C) has been proposed, which uses a logistic map which implies that a negligible difference in parameters of the map generates different cipher text. Cryptanalysis of the proposed algorithm shows the strength and security of algorithm and keys. Performance of the proposed algorithm has been analyzed in terms of running time, throughput and power consumption. It is to be shown in comparison graphs that the proposed algorithm gave better results compare to different algorithms like AES and some others.

show abstract

Section: Performance Analysismentioning

confidence: 99%