Symmetric Cryptoalgorithms in the Residue Number System

• DOI: 10.1007/s10559-021-00358-6
• Publication Date: 2021-04-01T07:04:53Z
• Authors: M. M. Kasianchuk; I. Z. Yakymenko; Ya. M. Nykolaychuk
• Keywords: Residue number system; Decimal; Chinese remainder theorem

This paper presents theoretical backgrounds of the symmetric encryption based on the residue number system. The peculiarities of this approach are that in the case of restoring a decimal number based on its residuals using the Chinese remainder theorem, multiplication occurs by arbitrarily chosen coefficients (keys). It is established that cryptostability of the developed methods is determined by the number of modules and their bit size. In addition, the described methods are found to allow to almost indefinitely increase the block of plain text for encryption, which eliminates the necessity to use different encryption modes.