Cryptographic System in Polynomial Residue Classes for Channels with Noise and Simulating Attacker

O. Finko, D. Samoylenko

Abstract: Noise-resistant modular cryptographic system that functions in polynomial residue classes is considered in this article. An algorithm for bases expansion of the cryptographic system is suggested. An estimation of interference-stability of proposed cryptographic system in relation to the traditional system is presented.

Keywords: Chinese Remainder Theorem, cryptanalyst, cryptography, cryptosystem, modular arithmetic, polynomial residue classes, Galois fields, interference coding

How to Cite?: O. Finko, D. Samoylenko, "Cryptographic System in Polynomial Residue Classes for Channels with Noise and Simulating Attacker", Volume 1 Issue 1, October 2012, International Journal of Science and Research (IJSR), Pages: 5-9, https://www.ijsr.net/getabstract.php?paperid=IJSR10120103, DOI: https://dx.doi.org/10.21275/IJSR10120103