Rabin-$p$ Cryptosystem: Practical and Efficient Method for Rabin based Encryption Scheme
This work addresses efficiency issues in cryptography for secure communication systems, though it appears incremental as it builds upon existing Rabin cryptosystem variants.
The authors tackled the problem of inefficient decryption in Rabin cryptosystems by introducing a new scheme that uses only a single prime number as the decryption key and requires just one modular exponentiation, reducing computational effort without needing extra bits or techniques like the Jacobi symbol.
In this work, we introduce a new, efficient and practical scheme based on the Rabin cryptosystem without using the Jacobi symbol, message redundancy technique or the needs of extra bits in order to specify the correct plaintext. Our system involves only a single prime number as the decryption key and does only one modular exponentiation. Consequently, this will practically reduce the computational efforts during decryption process. We demonstrate that the decryption is unique and proven to be equivalent to factoring.The scheme is performs better when compared to a number of Rabin cryptosystem variants.