Pure Infinitely Self-Modifying Code is Realizable and Turing-complete

• Autorzy: Morse G.

Identyfikatory

DOI

10.24425/119359

• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

x86; x86-64; assembly language; self-modifying code; turing completeness; code obfuscation

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: International Journal of Electronics and Telecommunications
• Rocznik: 2018
• Tom: Vol. 64, No. 2
• Strony: 123--129
• Opis fizyczny: Bibliogr. 4 poz., rys., tab.

Twórcy

autor

Morse G.

• Eötvös Loránd University, Hungary

Bibliografia

• [1] Dolan, S. mov is Turing-complete. Computer Laboratory, University of Cambridge. Technical report (2013).
• [2] The M/O/Vfuscator (2015). https://github.com/xoreaxeaxeax/movfuscator
• [3] Anckaert B., Madou M., De Bosschere K. (2007) A Model for Self-Modifying Code. In: Camenisch J.L., Collberg C.S., Johnson N.F., Sallee P. (eds) Information Hiding. IH 2006. Lecture Notes in Computer Science, vol 4437. Springer, Berlin, Heidelberg.
• [4] Hongxu Cai, Zhong Shao, Alexander Vaynberg, Certified selfmodifying code, ACM SIGPLAN Notices, v.42 n.6, June 2007.

Uwagi

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2018).