The comparison results show that the proposed algorithms are better than some other existing algorithms. We have compared the proposed chaos-based hash functions, block cipher and pseudorandom number generator with well-know algorithms. In additi on, a new one-dimensional triangle-chaotic map (TCM) with perfect chaotic behaviour is presented. The securities of the proposed algorithms are analyzed based on some well-know statistical tests in this filed.

Novel hash functions, encryption algorithms and pseudorandom number generators based on chaotic systems for electronic commerce are proposed. In this thesis, we comprehensively explore the analysis and design of security primitives based on chaotic systems for electronic commerce: hash functions, encryption algorithms and pseudorandom number generators. In view of this, designing new secure and fast security algorithms based on chaotic systems which guarantee integrity, authentication and confidentiality is essential for electronic commerce development. Several security algorithms based on chaotic systems have been proposed unfortunately some of them were found to be insecure and/or slow. Chaotic systems and security algorithms have similar properties including sensitivity to any change or changes in the initial parameters, unpredictability, deterministic nature and random-like behaviour. Security is considered the most important requirement for the success of electronic commerce, which is built based on the security of hash functions, encryption algorithms and pseudorandom number generators.

Graphics32 vs imageen