Симетричні криптоалгоритми у системі залишкових класів / Касянчук М. М., Якименко І. З., Николайчук Я. М. (2021)
Ukrainian

English  Cybernetics and Systems Analysis   /     Issue (2021, 57 (2))

Kasianchuk M.M., Yakymenko I.Z., Nykolaychuk Y.M.
Symmetric cryptoalgorithms in the residue number system

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. © 2021, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: ciphertext, cryptanalysis, cryptoalgorithm, residue number system, stabilitlity, symmetric cryptosystem, Numbering systems, Bit size, Chinese remainder theorem, Cryptoalgorithms, Encryption mode, Plain text, Residue number system, Symmetric encryption, Cryptography


Cite:
Kasianchuk M.M., Yakymenko I.Z., Nykolaychuk Y.M. (2021). Symmetric cryptoalgorithms in the residue number system. Cybernetics and Systems Analysis, 57 (2), 184–192. doi: https://doi.org/10.1007/s10559-021-00358-6 http://jnas.nbuv.gov.ua/article/UJRN-0001221033 [In Ukrainian].


 

Інститут інформаційних технологій НБУВ


+38 (044) 525-36-24
Голосіївський просп., 3, к. 209
м. Київ, 03039, Україна