Author: "Deng, Shaojiang" / Database: Academic Search Index / Publisher: elsevier b.v. / Topic: chaos and computer simulation - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Deng, Shaojiang"' showing total 2 results

Start Over Author "Deng, Shaojiang" Topic chaos Topic computer simulation Database Academic Search Index Publisher elsevier b.v.

Author: Deng, Shaojiang, Xiao, Di, Li, Yantao, and Peng, Wenbin
Subjects: *CRYPTOGRAPHY, *SEARCH algorithms, *CHAOS theory, *ITERATIVE methods (Mathematics), *DATA encryption, *COMPUTER simulation
Abstract: Abstract: A novel combined cryptographic and hash algorithm based on chaotic control character is proposed in this paper. The control character is generated by chaotic iteration. The plaintext is pre-processed in terms of control character, and then encrypted by the look-up index table. At the same time, the chaotic trajectory is changed continuously according to the control character, which can avoid the dynamical degradation of chaos. Besides, the look-up index table is updated by utilizing the control character continuously, and the index item of the final look-up index table can be considered as the hash value of the whole paragraph of plaintext. Therefore, the proposed algorithm can perform both encryption/decryption and hash in a combined manner. Compared with Wong’s and our former algorithms, the proposed one has decreased the ratio of ciphertext/plaintext to 1, and improved the efficiency greatly. Theoretical analysis and computer simulation verify the validity of the proposed algorithm. [Copyright &y& Elsevier]
Published: 2009
Full Text: View/download PDF

Author: Xiao, Di, Liao, Xiaofeng, and Deng, Shaojiang
Subjects: *HASHING, *COMPUTER simulation, *SIMULATION methods & models, *MODELS & modelmaking
Abstract: Abstract: Recently, a variety of chaos-based hash functions have been proposed. Nevertheless, none of them works efficiently in parallel computing environment. In this Letter, an algorithm for parallel keyed hash function construction is proposed, whose structure can ensure the uniform sensitivity of hash value to the message. By means of the mechanism of both changeable-parameter and self-synchronization, the keystream establishes a close relation with the algorithm key, the content and the order of each message block. The entire message is modulated into the chaotic iteration orbit, and the coarse-graining trajectory is extracted as the hash value. Theoretical analysis and computer simulation indicate that the proposed algorithm can satisfy the performance requirements of hash function. It is simple, efficient, practicable, and reliable. These properties make it a good choice for hash on parallel computing platform. [Copyright &y& Elsevier]
Published: 2008
Full Text: View/download PDF

Books, media, physical & digital resources

Searchworks