Abstract
Abstract
Security in the process of sending digital messages is very important to avoid being theft by unwanted parties. In order to protect the messages, modern cryptography techniques come into play. Public key cryptosystem based on the integer factorization such as Rabin-p could provide high confidentiality as long as the modulus is of a very large integer. On the contrary, having a longer modulus causes two problems: the longer the size of the ciphertext and the longer the time needed for the decryption process. In order to solve this problem, in this research, we combine Rabin-p cryptosystem and Spritz algorithm in a hybrid cryptosystem. Message is encrypted with Spritz algorithm, and the key of Spritz algorithm is then protected by Rabin-p cryptosystem. In this scheme, the encrypted message can be recovered back to the original message while maintaining small decryption time.
Subject
Computer Science Applications,History,Education
Reference2 articles.
1. Hardware Implementation of Greatest Common Divisor using Subtractor in Euclid Algorithm;Upadhyay,2013
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Rabin-P Encryption Scheme Analysis on MQTT;2023 IEEE 13th Symposium on Computer Applications & Industrial Electronics (ISCAIE);2023-05-20