Rate the Article: Cryptographic System in Polynomial Residue Classes for Channels with Noise and Simulating Attacker, IJSR, Call for Papers, Online Journal
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 192 | Views: 568 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1

Research Paper | Computer Science & Engineering | Russia | Volume 1 Issue 1, October 2012 | Rating: 6.3 / 10


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


Edition: Volume 1 Issue 1, October 2012,


Pages: 5 - 9



Rate this Article


Select Rating (Lowest: 1, Highest: 10)

5

Your Comments (Only high quality comments will be accepted.)

Characters: 0

Your Full Name:


Your Valid Email Address:


Verification Code will appear in 2 Seconds ... Wait

Top