7 citations · 10 across the 7 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2026
Tamper-Proofing with Self-Modifying Code
Gregory Morse, Tamás Kozsik
Classical computability theory tells us that self-modifying code (SMC) on a deterministic universal Turing machine can be simulated by non-SMC code on the same model. That abstract…
cs.CR2024
A compact QUBO encoding of computational logic formulae demonstrated on cryptography constructions
Gregory Morse, Tamás Kozsik, Oskar Mencer +1
We aim to advance the state-of-the-art in Quadratic Unconstrained Binary Optimization formulation with a focus on cryptography algorithms. As the minimal QUBO encoding of the linea…