Cryptography with Integer Multinumbers

This paper presents an analysis of a cryptographic algorithm based on integer multinumbers. We discuss the quantum-resistance of this algorithm, and some questions related to its security. In particular, we consider the problem of the generation of public keys for this algorithm, the problem of localization of a possible private key, and the problem of mismatches. Some recommendations for increasing the cryptoresistance of the algorithm are proposed.