A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q
In this paper, we introduce a new scheme based on the hardness of factoring integers of the shape N = p2q. Our scheme uses a combination of modular linear and modular squaring. We show that the decryption is 1-to-1 which is a great advantage over Rabin's cryptosystem. Its encryption speed has a...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute for Mathematical Research, Universiti Putra Malaysia
2013
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/39041/ http://psasir.upm.edu.my/id/eprint/39041/1/39041.pdf |
| _version_ | 1848849037305839616 |
|---|---|
| author | Kamel Ariffin, Muhammad Rezal Asbullah, Muhammad Asyraf Abu, Nur Azman Mahad, Zahari |
| author_facet | Kamel Ariffin, Muhammad Rezal Asbullah, Muhammad Asyraf Abu, Nur Azman Mahad, Zahari |
| author_sort | Kamel Ariffin, Muhammad Rezal |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | In this paper, we introduce a new scheme based on the hardness of factoring integers of the shape N = p2q. Our scheme uses a combination of modular linear and modular squaring. We show that the decryption is 1-to-1 which is a great advantage over Rabin's cryptosystem. Its encryption speed has a complexity order faster than RSA and ECC. For decryption its speed is better than RSA and is marginally behind ECC. Constructed using a simple mathematical structure, it has low computational requirements and would enable communication devices with low computing power to deploy secure communication procedures efficiently. |
| first_indexed | 2025-11-15T09:44:01Z |
| format | Article |
| id | upm-39041 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T09:44:01Z |
| publishDate | 2013 |
| publisher | Institute for Mathematical Research, Universiti Putra Malaysia |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-390412015-09-01T11:21:40Z http://psasir.upm.edu.my/id/eprint/39041/ A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q Kamel Ariffin, Muhammad Rezal Asbullah, Muhammad Asyraf Abu, Nur Azman Mahad, Zahari In this paper, we introduce a new scheme based on the hardness of factoring integers of the shape N = p2q. Our scheme uses a combination of modular linear and modular squaring. We show that the decryption is 1-to-1 which is a great advantage over Rabin's cryptosystem. Its encryption speed has a complexity order faster than RSA and ECC. For decryption its speed is better than RSA and is marginally behind ECC. Constructed using a simple mathematical structure, it has low computational requirements and would enable communication devices with low computing power to deploy secure communication procedures efficiently. Institute for Mathematical Research, Universiti Putra Malaysia 2013 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/39041/1/39041.pdf Kamel Ariffin, Muhammad Rezal and Asbullah, Muhammad Asyraf and Abu, Nur Azman and Mahad, Zahari (2013) A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q. Malaysian Journal of Mathematical Sciences, 7 (S). pp. 19-37. ISSN 1823-8343; ESSN: 2289-750X http://einspem.upm.edu.my/journal/fullpaper/vol7new/2.%20M.R.K.%20Arifffin%20et%20al.pdf |
| spellingShingle | Kamel Ariffin, Muhammad Rezal Asbullah, Muhammad Asyraf Abu, Nur Azman Mahad, Zahari A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q |
| title | A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q |
| title_full | A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q |
| title_fullStr | A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q |
| title_full_unstemmed | A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q |
| title_short | A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q |
| title_sort | new efficient asymmetric cryptosystem based on the integer factorization problem of n=p2q |
| url | http://psasir.upm.edu.my/id/eprint/39041/ http://psasir.upm.edu.my/id/eprint/39041/ http://psasir.upm.edu.my/id/eprint/39041/1/39041.pdf |