Comparative analysis of three asymmetric encryption schemes based upon the intractability of square roots modulo N = p²q
In this paper, we conduct a comparative study for three encryption schemes based upon the difficulties to compute square roots modulo N = p²q , namely HIME(R), Rabin-Takagi and AAβ public key cryptosystem. The running time estimation for each scheme is presented using the single-precision multiplic...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
Institute for Mathematical Research, Universiti Putra Malaysia
2014
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/66482/ http://psasir.upm.edu.my/id/eprint/66482/1/Cryptology2014-3.pdf |
| _version_ | 1848855582263476224 |
|---|---|
| author | Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal |
| author_facet | Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal |
| author_sort | Asbullah, Muhammad Asyraf |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | In this paper, we conduct a comparative study for three encryption schemes based upon the difficulties to compute square roots modulo N = p²q , namely HIME(R), Rabin-Takagi and AAβ public key cryptosystem. The running time estimation for each scheme is presented using the single-precision multiplication measurement. We then evaluate the memory cost for system parameters and accumulators during the encryption and decryption process. We observe that there is a trade-off between speed and memory consumption as our result shows AAβ encryption is slower than the other two schemes, but slightly faster when decryption. Due to its large size of plaintext, AAβ consume a greater amount of memory during encryption while use less memory usage for decryption relatively to HIME(R) and Rabin-Takagi. |
| first_indexed | 2025-11-15T11:28:03Z |
| format | Conference or Workshop Item |
| id | upm-66482 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T11:28:03Z |
| publishDate | 2014 |
| publisher | Institute for Mathematical Research, Universiti Putra Malaysia |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-664822019-03-03T23:54:14Z http://psasir.upm.edu.my/id/eprint/66482/ Comparative analysis of three asymmetric encryption schemes based upon the intractability of square roots modulo N = p²q Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal In this paper, we conduct a comparative study for three encryption schemes based upon the difficulties to compute square roots modulo N = p²q , namely HIME(R), Rabin-Takagi and AAβ public key cryptosystem. The running time estimation for each scheme is presented using the single-precision multiplication measurement. We then evaluate the memory cost for system parameters and accumulators during the encryption and decryption process. We observe that there is a trade-off between speed and memory consumption as our result shows AAβ encryption is slower than the other two schemes, but slightly faster when decryption. Due to its large size of plaintext, AAβ consume a greater amount of memory during encryption while use less memory usage for decryption relatively to HIME(R) and Rabin-Takagi. Institute for Mathematical Research, Universiti Putra Malaysia 2014 Conference or Workshop Item PeerReviewed text en http://psasir.upm.edu.my/id/eprint/66482/1/Cryptology2014-3.pdf Asbullah, Muhammad Asyraf and Kamel Ariffin, Muhammad Rezal (2014) Comparative analysis of three asymmetric encryption schemes based upon the intractability of square roots modulo N = p²q. In: 4th International Cryptology and Information Security Conference 2014 (CRYPTOLOGY2014), 24-26 June 2014, Putrajaya, Malaysia. (pp. 86-99). |
| spellingShingle | Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal Comparative analysis of three asymmetric encryption schemes based upon the intractability of square roots modulo N = p²q |
| title | Comparative analysis of three asymmetric encryption schemes based upon the intractability of square roots modulo N = p²q |
| title_full | Comparative analysis of three asymmetric encryption schemes based upon the intractability of square roots modulo N = p²q |
| title_fullStr | Comparative analysis of three asymmetric encryption schemes based upon the intractability of square roots modulo N = p²q |
| title_full_unstemmed | Comparative analysis of three asymmetric encryption schemes based upon the intractability of square roots modulo N = p²q |
| title_short | Comparative analysis of three asymmetric encryption schemes based upon the intractability of square roots modulo N = p²q |
| title_sort | comparative analysis of three asymmetric encryption schemes based upon the intractability of square roots modulo n = p²q |
| url | http://psasir.upm.edu.my/id/eprint/66482/ http://psasir.upm.edu.my/id/eprint/66482/1/Cryptology2014-3.pdf |