DEVELOPMENT AND RESEARCH OF CRYPTOGRAPHIC HASH FUNCTIONS BASED ON TWO-DIMENSIONAL CELLULAR AUTOMATA

Software solution for cryptographic hash functions based on sponge construction with inner state implemented as two-dimensional cellular automata (CA) has been developed. To perform pseudorandom permutation in round transformation function several combinations of CA rules 30, 54, 86, 150 and 158 have been proposed. The developed hashing mechanism provides effective parallel processing, ensures good statistical and scattering properties, enables one to obtain hash of a varying length and reveals strong avalanche effect.

Download Full-text

Building Secure and Fast Cryptographic Hash Functions Using Programmable Cellular Automata

Journal of Computing and Information Technology ◽

10.2498/cit.1002639 ◽

2015 ◽

Vol 23 (4) ◽

pp. 317 ◽

Cited By ~ 4

Author(s):

Alaa Eddine Belfedhal ◽

Kamel Mohamed Faraoun

Keyword(s):

Cellular Automata ◽

Hash Functions ◽

Cryptographic Hash Functions

Download Full-text

Cryptographic hash functions based on generalized cellular automata

Science and Education of the Bauman MSTU ◽

10.7463/0113.0534640 ◽

2013 ◽

Vol 13 (01) ◽

Cited By ~ 3

Author(s):

Petr Klyucharev

Keyword(s):

Cellular Automata ◽

Hash Functions ◽

Cryptographic Hash Functions

Download Full-text

Parameterized FPGA-based implementation of cryptographic hash functions using cellular automata

2018 IEEE 9th International Conference on Dependable Systems, Services and Technologies (DESSERT) ◽

10.1109/dessert.2018.8409133 ◽

2018 ◽

Author(s):

Yuliya Tanasyuk ◽

Artem Perepelitsyn ◽

Sergey Ostapov

Keyword(s):

Cellular Automata ◽

Hash Functions ◽

Cryptographic Hash Functions

Download Full-text

FPGA implementation of general cellular automata based cryptographic hash functions: performance and effectiveness

Science and Education of the Bauman MSTU ◽

10.7463/0114.0675812 ◽

2014 ◽

Vol 14 (01) ◽

Cited By ~ 1

Author(s):

Petr Klyucharev

Keyword(s):

Cellular Automata ◽

Hash Functions ◽

Fpga Implementation ◽

Cryptographic Hash Functions

Download Full-text

Practical (Second) Preimage Attacks on the TCS_SHA-3 Family of Cryptographic Hash Functions

Journal of Information Processing Systems ◽

10.3745/jips.03.0021 ◽

2014 ◽

Keyword(s):

Hash Functions ◽

Cryptographic Hash Functions

Download Full-text

A CellBE-based HPC Application for the Analysis of Vulnerabilities in Cryptographic Hash Functions

2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC) ◽

10.1109/hpcc.2010.113 ◽

2010 ◽

Cited By ~ 5

Author(s):

Alessandro Cilardo ◽

Luigi Esposito ◽

Antonio Veniero ◽

Antonino Mazzeo ◽

Vicenç Beltran ◽

...

Keyword(s):

Hash Functions ◽

Cryptographic Hash Functions

Download Full-text

A STUDY OF BIFURCATIONS IN A CIRCULAR REAL CELLULAR AUTOMATON

International Journal of Bifurcation and Chaos ◽

10.1142/s0218127493000234 ◽

1993 ◽

Vol 03 (02) ◽

pp. 293-321 ◽

Cited By ~ 1

Author(s):

JÜRGEN WEITKÄMPER

Keyword(s):

Hopf Bifurcation ◽

Dynamical Systems ◽

Cellular Automata ◽

Cellular Automaton ◽

Parallel Computers ◽

Discrete Dynamical Systems ◽

Two Dimensional ◽

Bifurcation Structure ◽

Logistic Mapping ◽

Henon Mapping

Real cellular automata (RCA) are time-discrete dynamical systems on ℝN. Like cellular automata they can be obtained from discretizing partial differential equations. Due to their structure RCA are ideally suited to implementation on parallel computers with a large number of processors. In a way similar to the Hénon mapping, the system we consider here embeds the logistic mapping in a system on ℝN, N>1. But in contrast to the Hénon system an RCA in general is not invertible. We present some results about the bifurcation structure of such systems, mostly restricting ourselves, due to the complexity of the problem, to the two-dimensional case. Among others we observe cascades of cusp bifurcations forming generalized crossroad areas and crossroad areas with the flip curves replaced by Hopf bifurcation curves.

Download Full-text