Showing 2024Show all
2 papers · 1 filter
cs.LO2024
Deciding subspace reachability problems with application to Skolem's Problem
Samuel Everett
The higher-dimensional version of Kannan and Lipton's Orbit Problem asks whether it is decidable if a target subspace can be reached from a starting point under repeated applicatio…
cs.CR2024
On the use of dynamical systems in cryptography
Samuel Everett
Ever since the link between nonlinear science and cryptography became apparent, the problem of applying chaotic dynamics to the construction of cryptographic systems has gained a b…