In 1979, Rabin introduced a variation of RSA using the encryption exponent 2, which has become popular because of its speed. Its drawback is decryption to four possible messages which has led to various ideas to identify the correct plaintext. This paper provides a new Rabin-type cryptosystem based on a modulus of the form 𝑝2𝑞. Along with a theoretical proof that the decryption is correct, we provide a complete example. To demonstrate its efficiency, we compare runtime of our algorithms with those of two others with similar aims. We also conjecture that our scheme is secure against chosen ciphertext attacks because of our inclusion of Simplified Optimal Asymmetric Encryption Padding of messages.
History
Volume
1338
Pagination
61-77
Location
Online from Brisbane, Qld.
Start date
2020-11-12
End date
2020-11-13
ISSN
1865-0929
eISSN
1865-0937
ISBN-13
9789813347052
Language
eng
Publication classification
E1 Full written paper - refereed
Editor/Contributor(s)
Batina L, Li G
Title of proceedings
ATIS 2020 : Proceedings of the 11th International Conference on Applications and Techniques in Information Security
Event
Applications and Techniques in Information Security. Conference (11th : 2020 : Online from Brisbane, Qld.)
Publisher
Springer Nature
Place of publication
Singapore
Series
Applications and Techniques in Information Security Conference