Hash function based on chaos
Küçük Resim Yok
Tarih
2009
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Maltepe Üniversitesi
Erişim Hakkı
CC0 1.0 Universal
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Özet
Data encryption has an important role in communication security, hash function in a kind of encryption of data and the famous hash functions like SHA, MD4, MD5, WHIRPOOL need a great deal of computations even for the small messages. There are some other methods based on chaos which are in fact the art of security achievement by encoding the messages to make them non-readable, the chaos based encryptions are widely extended since last ten years, because of chose relations between chaos and cryptography and chaotic systems having some properties such as sensitivity to the initial conditions, and control parameters, and randomized behavior which can be connected with some conventional properties of good ciphers such as confusion/diffusion, secures the communications[1]. The algorithms are mostly constituted on a linear or nonlinear mapping [2, 3,] as the random encryptions are performed in this algorithms, the algorithms posses a high level of security. In this paper we introduce a one-sided hash function algorithm is constructed on exponential scores with a changeable parameter say p. A section of this function is given, in each run block ciphers encryption procedure produces the parameter p then the value of hash function is obtained by randomized setting of the first few sequences of iterations. Statistical analysis and computer simulation indicates a good performance of Hash function and is reliable with high potential.
Açıklama
Anahtar Kelimeler
Kaynak
International Conference of Mathematical Sciences
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Hashemiparast, S. M. ve Fallahgoul, H. (2009). Hash function based on chaos. Maltepe Üniversitesi. s. 351.
