Rabin's modified method of encryption using various forms of system of residual classes

The development of three modular Rabin's encryption algorithm with using ordinary integer and modified perfect forms of the system of residual classes is presented in this paper. This method takes precedence over classic in choosing modules of the same order in sustainability by increasing the...

Full description

Saved in:
Bibliographic Details
Published in2017 14th International Conference The Experience of Designing and Application of CAD Systems in Microelectronics (CADSM) pp. 222 - 224
Main Authors Kasianchuk, Mykhaylo, Yakymenko, Ihor, Pazdriy, Ihor, Melnyk, Andriy, Ivasiev, Stepan
Format Conference Proceeding
LanguageEnglish
Published IEEE 2017
Subjects
Chinese Remainder Theorem
Computer science
Computers
Economics
Encryption
inverse element
module
Presses
Public key
Rabin cryptosystem
Online AccessGet full text
DOI10.1109/CADSM.2017.7916120

Cover

More Information
Summary:The development of three modular Rabin's encryption algorithm with using ordinary integer and modified perfect forms of the system of residual classes is presented in this paper. This method takes precedence over classic in choosing modules of the same order in sustainability by increasing the block of plaintext for encryption. New methods for implementation of major labor-intensive operations of modular arithmetic are proposed: finding the square root and inverse elements by module. It is established that on the basis of HDL-models that can successfully implement on the modern programmable logical integrated schemes or programmable logical matrixes, the runtime of three modular Rabin's encryption algorithm with using a modified perfect form is reduced approximately half compared with conventional integer form.
DOI:10.1109/CADSM.2017.7916120