Generating Hard Problems of Cellular Automata
share
We propose two hard problems in cellular automata. In particular the problems are: [DDP^M_n,p] Given two randomly chosen configurations t and s of a cellular automata of length n, find the number of transitions τ between s and t. [SDDP^δ_k,n] Given two randomly chosen configurations s of a cellular automata of length n and x of length k<n, find the configuration t such that k number of cells of t is fixed to x and t is reachable from s within δ transitions. We show that the discrete logarithm problem over the finite field reduces to DDP^M_n,p and the short integer solution problem over lattices reduces to SDDP^δ_k,n. The advantage of using such problems as the hardness assumptions in cryptographic protocols is that proving the security of the protocols requires only the reduction from these problems to the designed protocols. We design one such protocol namely a proof-of-work out of SDDP^δ_k,n.
READ FULL TEXT
