The one way function based on Collatz problem is proposed. While Colatz ($3x+1$) problem is well ... more The one way function based on Collatz problem is proposed. While Colatz ($3x+1$) problem is well known and undecided, the proposal is actually based on the problem's underlying conditional branching structure. The analysis shows why the $3x+1$ problem is so difficult and how the algorithm conditional branching structure can be used to construct an one way function.
Randomness is somewhat opposite to determinism. This essay tries to put this two on the same page... more Randomness is somewhat opposite to determinism. This essay tries to put this two on the same page. It argues the premise where randomness is a consequence of a deterministic process. It also provides yet another viewpoint on the hidden variable theory.
The main result is that: function descriptions are not made equal, and they can be categorised in... more The main result is that: function descriptions are not made equal, and they can be categorised in at least two categories using various computational methods for function evaluation. The result affects Kolmogorov complexity and Random Oracle Model notions. More precisely, the idea that the size of an object and the size of the smallest computer program defining that object is a ratio that represents the object complexity needs additional definitions to hold its original assertions.
A puzzle lies behind password authentication (PA) and blockchain proof of work (PoW). A cryptogra... more A puzzle lies behind password authentication (PA) and blockchain proof of work (PoW). A cryptographic hash function is commonly used to implement them. The potential problem with secure hash functions is their complexity and rigidity. We explore the use of complex systems constructs such as a cellular automaton (CA) to provide puzzle functionality. The analysis shows that computational irreducibility and sensitivity to initial state phenomena are enough to create simple puzzle systems that can be used for PA and PoW. Moreover, we present puzzle schemata using CA and n-body problems.
The one way function based on Collatz problem is proposed. While Colatz ($3x+1$) problem is well ... more The one way function based on Collatz problem is proposed. While Colatz ($3x+1$) problem is well known and undecided, the proposal is actually based on the problem's underlying conditional branching structure. The analysis shows why the $3x+1$ problem is so difficult and how the algorithm conditional branching structure can be used to construct an one way function.
Randomness is somewhat opposite to determinism. This essay tries to put this two on the same page... more Randomness is somewhat opposite to determinism. This essay tries to put this two on the same page. It argues the premise where randomness is a consequence of a deterministic process. It also provides yet another viewpoint on the hidden variable theory.
The main result is that: function descriptions are not made equal, and they can be categorised in... more The main result is that: function descriptions are not made equal, and they can be categorised in at least two categories using various computational methods for function evaluation. The result affects Kolmogorov complexity and Random Oracle Model notions. More precisely, the idea that the size of an object and the size of the smallest computer program defining that object is a ratio that represents the object complexity needs additional definitions to hold its original assertions.
A puzzle lies behind password authentication (PA) and blockchain proof of work (PoW). A cryptogra... more A puzzle lies behind password authentication (PA) and blockchain proof of work (PoW). A cryptographic hash function is commonly used to implement them. The potential problem with secure hash functions is their complexity and rigidity. We explore the use of complex systems constructs such as a cellular automaton (CA) to provide puzzle functionality. The analysis shows that computational irreducibility and sensitivity to initial state phenomena are enough to create simple puzzle systems that can be used for PA and PoW. Moreover, we present puzzle schemata using CA and n-body problems.
Uploads
Papers by Rade Vuckovac