Simple Search:

Comparative analysis of three asymmetric encryption schemes based upon the intractability of square roots modulo N = p²q


Citation

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).

Abstract / Synopsis

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.


Download File

[img] PDF
Cryptology2014-3.pdf
Restricted to Repository staff only

Download (777kB)

Additional Metadata

Item Type: Conference or Workshop Item (Paper)
Divisions: Faculty of Science
Institute for Mathematical Research
Publisher: Institute for Mathematical Research, Universiti Putra Malaysia
Keywords: Asymmetric encryption; Running time; Single-precision multiplication
Depositing User: Nabilah Mustapa
Date Deposited: 04 Mar 2019 07:54
Last Modified: 04 Mar 2019 07:54
URI: http://psasir.upm.edu.my/id/eprint/66482
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item