Schönhage machines can be vulnerable

Abstract

The article discusses an invasion model in the form of memory destruction of one type of abstract algorithm executor introduced by Schönhage. Two invasion scenarios are defined (attack without aftereffect and attack with aftereffect), and the macros proposed in the article are used to program variants of destroying the memory of this performer. It is shown that even the limited capabilities of the Schönhage machines (the attacker) make it possible to perform both partial and complete destruction of the memory of the attacked Schönhage machine (the victim). Destruction of memory is understood as its destructuring, in which access to some of its elements or all elements becomes impossible. However, for a certain class of Schönhage machines (machines with a regular memory structure), it is possible to detect their memory in order to establish the fact of its damage. The regularity of the memory structure is understood as the possibility of describing this structure by a graph grammar, which specifies a finite set of patterns of structures, replicated when constructing the generated graph in a way defined in the grammar. Examples of Schönhage machines are given, the memory structure of which is described by the grammars noted above. Sources of threats are not considered in this article. Only some forms of threats and the possibility of their implementation by means of Schönhage machines are being studied