hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.1002639

Building Secure and Fast Cryptographic Hash Functions Using Programmable Cellular Automata

Alaa Eddine Belfedhal ; Computer Sciences Department, Djillali Liabes University of Sidi Bel Abbes, Algeria
Kamel Mohamed Faraoun ; Computer Sciences Department, Djillali Liabes University of Sidi Bel Abbes, Algeria

Puni tekst: engleski, pdf (850 KB) str. 317-328 preuzimanja: 678* citiraj
APA 6th Edition
Belfedhal, A.E. i Faraoun, K.M. (2015). Building Secure and Fast Cryptographic Hash Functions Using Programmable Cellular Automata. Journal of computing and information technology, 23 (4), 317-328. https://doi.org/10.2498/cit.1002639
MLA 8th Edition
Belfedhal, Alaa Eddine i Kamel Mohamed Faraoun. "Building Secure and Fast Cryptographic Hash Functions Using Programmable Cellular Automata." Journal of computing and information technology, vol. 23, br. 4, 2015, str. 317-328. https://doi.org/10.2498/cit.1002639. Citirano 12.04.2021.
Chicago 17th Edition
Belfedhal, Alaa Eddine i Kamel Mohamed Faraoun. "Building Secure and Fast Cryptographic Hash Functions Using Programmable Cellular Automata." Journal of computing and information technology 23, br. 4 (2015): 317-328. https://doi.org/10.2498/cit.1002639
Harvard
Belfedhal, A.E., i Faraoun, K.M. (2015). 'Building Secure and Fast Cryptographic Hash Functions Using Programmable Cellular Automata', Journal of computing and information technology, 23(4), str. 317-328. https://doi.org/10.2498/cit.1002639
Vancouver
Belfedhal AE, Faraoun KM. Building Secure and Fast Cryptographic Hash Functions Using Programmable Cellular Automata. Journal of computing and information technology [Internet]. 2015 [pristupljeno 12.04.2021.];23(4):317-328. https://doi.org/10.2498/cit.1002639
IEEE
A.E. Belfedhal i K.M. Faraoun, "Building Secure and Fast Cryptographic Hash Functions Using Programmable Cellular Automata", Journal of computing and information technology, vol.23, br. 4, str. 317-328, 2015. [Online]. https://doi.org/10.2498/cit.1002639

Sažetak
Cryptographic hash functions have recently brought an exceptional research interest. With the increasing number of attacks against the widely used functions as MD5, SHA-1 and RIPEMD, the need to consider new hash functions design and conception strategies becomes crucial. In this paper, we propose a fast and efficient hash function using programmable cellular automata that are very suitable for cryptographic applications due to their chaotic and complex behavior derived from simple rules interaction. The proposed function is evaluated using several statistical tests, while obtained results demonstrate very admissible cryptographic properties such as confusion/diffusion capability and high sensitivity to input changes. Furthermore, the hashing scheme can be easily implemented through software or hardware, so it provides very competitive running performances.

Ključne riječi
cryptographic hash function; programmable cellular automata; cellular automata rule; pseudorandomness; avalanche effect

Hrčak ID: 149737

URI
https://hrcak.srce.hr/149737

Posjeta: 889 *