Optimal representation in the form of logical functions of microinstructions of cryptographic algorithms (RSA, El-Gamal)

This article resolves the problem of logical representation of the classical asymmetric RSA public key encryption algorithms (Rivest, Shamir, and Adleman) and El Gamal in order to implement them on hard devices (microcontrollers). It is shown that the algorithms under study can be described by a set of micro-instructions consisting of a sequence of operators and, based on the analysis of graph-schemes, logical, algebraic and matrix representations of algorithms, construct a minimal logical representation for implementation on hard devices