- Tytuł:
- Pure Infinitely Self-Modifying Code is Realizable and Turing-complete
- Autorzy:
- Morse, G.
- Powiązania:
- https://bibliotekanauki.pl/articles/227291.pdf
- Data publikacji:
- 2018
- Wydawca:
- Polska Akademia Nauk. Czytelnia Czasopism PAN
- Tematy:
-
x86
x86-64
assembly language
self-modifying code
turing completeness
code obfuscation - Opis:
- Although self-modifying code has been shyed away from due to its complexity and discouragement due to safety issues, it nevertheless provides for a very unique obfuscation method and a different perspective on the relationship between data and code. The generality of the von Neumann architecture is hardly realized by today’s processor models. A code-only model is shown where every instruction merely modifies other instructions yet achieves the ability to compute and Turing machine operation is easily possible.
- Źródło:
-
International Journal of Electronics and Telecommunications; 2018, 64, 2; 123-129
2300-1933 - Pojawia się w:
- International Journal of Electronics and Telecommunications
- Dostawca treści:
- Biblioteka Nauki
Artykuł