Generation of decryption key for the RSA cryptosystem using the minimum redundant modular number system
The article is devoted to the problem of generating a cryptosystem RSA key decryption on the known open parameters - system module and the encryption key. Minimum excess modular numeral system is applied to receiving multiplicative inversion of an open key on Euler's function of the system module. Its bases are the elements of the factor-spectrum base of Euler's function, as well as specially selected additional base. The realized approach allows to minimize the volume of the carried-out calculations. This is ensured thanks to achieved within the minimum excess modular coding to reduce the extremely low level of complexity of accounting ratios used for the integral characteristics of the code - interval-index characteristics.