Matches in SemOpenAlex for { <https://semopenalex.org/work/W118573777> ?p ?o ?g. }
- W118573777 endingPage "19" @default.
- W118573777 startingPage "1" @default.
- W118573777 abstract "Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A simple computational model which captures this constraint is a cellular automaton: A discrete dynamical system in which cells are placed on a grid and the state of each cell is updated via a local deterministic rule that depends only on the few cells within its close neighborhood. Cellular automata are commonly used to model real world systems in nature and society. Cellular automata were shown to be capable of a highly complex behavior. However, it is not clear how fast this complexity can evolve and how common it is with respect to all possible initial configurations. We examine this question from a computational perspective, identifying “complexity” with computational intractability. More concretely, we consider an n-cell automaton with a random initial configuration, and study the minimal number of computation steps t = t(n) after which the following problems can become computationally hard: • The inversion problem. Given the configuration y at time t, find an initial configuration x which leads to y in t steps. • The prediction problem. Given an arbitrary sequence of > n intermediate values of cells in the computation, predict some value in the sequence based on the previous values with a significant advantage over guessing. These two problems capture the natural goals of inferring the past from the present and predicting the future based on partial observations of the past. Our main results show that, under widely believed conjectures, there are cellular automata for which both problems become hard even after a single computation step. This is done by constructing cryptographic one-way functions and pseudorandom generators which are computed by a single step of a cellular automaton. Our results support the view that computational forms of complexity can emerge from simple local interactions in a very common and immediate way. Our results build on and strengthen previous results of Applebaum et al. (FOCS 2004, CRYPTO 2007) on the parallel complexity of cryptography. These previous works implement cryptographic primitives by circuits with constant depth, constant fan-in and constant fan-out, but inherently fail to satisfy the strong spatial locality requirement." @default.
- W118573777 created "2016-06-24" @default.
- W118573777 creator A5036104549 @default.
- W118573777 creator A5081852077 @default.
- W118573777 creator A5086684679 @default.
- W118573777 date "2010-01-01" @default.
- W118573777 modified "2023-09-26" @default.
- W118573777 title "Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature" @default.
- W118573777 cites W1486527429 @default.
- W118573777 cites W1490189322 @default.
- W118573777 cites W1490590996 @default.
- W118573777 cites W1491483938 @default.
- W118573777 cites W1507263262 @default.
- W118573777 cites W1514889335 @default.
- W118573777 cites W1529679142 @default.
- W118573777 cites W1562285034 @default.
- W118573777 cites W1572614022 @default.
- W118573777 cites W1851924232 @default.
- W118573777 cites W1856342626 @default.
- W118573777 cites W1954882695 @default.
- W118573777 cites W1982180670 @default.
- W118573777 cites W1985043179 @default.
- W118573777 cites W1989868236 @default.
- W118573777 cites W1993729573 @default.
- W118573777 cites W1995897489 @default.
- W118573777 cites W1999211268 @default.
- W118573777 cites W2001109406 @default.
- W118573777 cites W2008699161 @default.
- W118573777 cites W2011429979 @default.
- W118573777 cites W2026103826 @default.
- W118573777 cites W2027528470 @default.
- W118573777 cites W2035929826 @default.
- W118573777 cites W2036265926 @default.
- W118573777 cites W2038618968 @default.
- W118573777 cites W2042194938 @default.
- W118573777 cites W2045583484 @default.
- W118573777 cites W2056002932 @default.
- W118573777 cites W2061106457 @default.
- W118573777 cites W2061743560 @default.
- W118573777 cites W2065151783 @default.
- W118573777 cites W2095374884 @default.
- W118573777 cites W2108704847 @default.
- W118573777 cites W2110761203 @default.
- W118573777 cites W2130389396 @default.
- W118573777 cites W2138532540 @default.
- W118573777 cites W2144769627 @default.
- W118573777 cites W2149636648 @default.
- W118573777 cites W2156186849 @default.
- W118573777 cites W2156760067 @default.
- W118573777 cites W2160584199 @default.
- W118573777 cites W2164284862 @default.
- W118573777 cites W2165156793 @default.
- W118573777 cites W2169341714 @default.
- W118573777 cites W2725618040 @default.
- W118573777 cites W2887278875 @default.
- W118573777 cites W2894564506 @default.
- W118573777 cites W2986959318 @default.
- W118573777 cites W86126052 @default.
- W118573777 cites W2518438090 @default.
- W118573777 hasPublicationYear "2010" @default.
- W118573777 type Work @default.
- W118573777 sameAs 118573777 @default.
- W118573777 citedByCount "6" @default.
- W118573777 countsByYear W1185737772012 @default.
- W118573777 countsByYear W1185737772013 @default.
- W118573777 countsByYear W1185737772014 @default.
- W118573777 countsByYear W1185737772016 @default.
- W118573777 countsByYear W1185737772017 @default.
- W118573777 crossrefType "proceedings-article" @default.
- W118573777 hasAuthorship W118573777A5036104549 @default.
- W118573777 hasAuthorship W118573777A5081852077 @default.
- W118573777 hasAuthorship W118573777A5086684679 @default.
- W118573777 hasConcept C112505250 @default.
- W118573777 hasConcept C11413529 @default.
- W118573777 hasConcept C116248031 @default.
- W118573777 hasConcept C127964446 @default.
- W118573777 hasConcept C134306372 @default.
- W118573777 hasConcept C138885662 @default.
- W118573777 hasConcept C174327141 @default.
- W118573777 hasConcept C179799912 @default.
- W118573777 hasConcept C192499940 @default.
- W118573777 hasConcept C2524010 @default.
- W118573777 hasConcept C2776036281 @default.
- W118573777 hasConcept C2778112365 @default.
- W118573777 hasConcept C2779808786 @default.
- W118573777 hasConcept C33923547 @default.
- W118573777 hasConcept C34388435 @default.
- W118573777 hasConcept C35527583 @default.
- W118573777 hasConcept C41008148 @default.
- W118573777 hasConcept C41895202 @default.
- W118573777 hasConcept C45374587 @default.
- W118573777 hasConcept C54355233 @default.
- W118573777 hasConcept C75745568 @default.
- W118573777 hasConcept C80444323 @default.
- W118573777 hasConcept C86803240 @default.
- W118573777 hasConceptScore W118573777C112505250 @default.
- W118573777 hasConceptScore W118573777C11413529 @default.
- W118573777 hasConceptScore W118573777C116248031 @default.