Name
Title | ||
|---|---|---|
Algorithmic Support for Rabin Three-Modular Cryptosystem Based on the Operation of Addition |
Abstract | ||
|---|---|---|
Algorithmic support for three-modular asymmetric Rabin encryption algorithm using only the addition operation is developed. Squaring is proposed to perform using the vector-modular method of modular multiplication. The method of adding product modules is proposed to use for decimal number recovery from its residues during decryption. Conducted studies of time complexities of the proposed approach and the classical one showed the advantages of the developed method. Its use allows us to reduce time complexity from cubic to quadratic. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/CSIT49958.2020.9321934 | 2020 IEEE 15th International Conference on Computer Sciences and Information Technologies (CSIT) |
Keywords | DocType | Volume |
three-modular asymmetric Rabin encryption algorithm,Chinese Remainder Theorem,time complexity,vector-modular method of modular multiplication | Conference | 1 |
ISSN | ISBN | Citations |
2766-3655 | 978-1-7281-7444-0 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor Yakymenko | 1 | 2 | 0.75 |
| Inna Shylinska | 2 | 0 | 0.34 |
| Mykhailo Kasianchuk | 3 | 2 | 0.75 |
| Lesia Bilovus | 4 | 0 | 0.34 |
| Oksana Gomotiuk | 5 | 2 | 0.75 |