Data Encryption Method Based on the McEliece Cryptosystem and the Redundant Residue Number System
This paper proposes a data encryption method based on a modified McEliece cryptosystem, in which classic Goppa codes are replaced by error-correcting codes from the Redundant Residue Number System (RRNS). The construction of the RRNS code’s generator matrix and the formation of the public key as a composition of the G matrix, a scrambling matrix S, and a permutation matrix P have been described. An approach has been developed for selecting the RRNS moduli system, ensuring the necessary code parameters and the highest possible rank of the generator matrix.