A review on heuristics for addition chain problem: towards efficient public key cryptosystems
Field exponentiation and scalar multiplication are the pillars of and the most computationally expensive operations in the public key cryptosystems. Optimizing the operation is the key to the efficiency of the systems. Analogous to the optimization is solving addition chain problem. In this study, w...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Science Publications
2017
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/60718/ http://psasir.upm.edu.my/id/eprint/60718/1/A%20review%20on%20heuristics%20for%20addition%20chain%20problem%20towards%20efficient%20public%20key%20cryptosystems.pdf |
| _version_ | 1848854257699127296 |
|---|---|
| author | Muhammad Noma, Adamu Muhammed, Abdullah Mohamed, Mohamad Afendee Ahmad Zulkarnain, Zuriati |
| author_facet | Muhammad Noma, Adamu Muhammed, Abdullah Mohamed, Mohamad Afendee Ahmad Zulkarnain, Zuriati |
| author_sort | Muhammad Noma, Adamu |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Field exponentiation and scalar multiplication are the pillars of and the most computationally expensive operations in the public key cryptosystems. Optimizing the operation is the key to the efficiency of the systems. Analogous to the optimization is solving addition chain problem. In this study, we survey from the onset of the addition chain problem to the state-of-the-art heuristics for optimizing it, with the view to identifying fundamental issues that when addressed renders the heuristics most optimal mean of minimizing the two operations in various public key cryptosystems. Thus, our emphasis is specifically on the heuristics: Their various constraints and implementations efficiencies. We present possible ways forwards toward the optimal solution for the addition chain problem that can be efficiently applied for optimal implementation of the public key cryptosystems. |
| first_indexed | 2025-11-15T11:07:00Z |
| format | Article |
| id | upm-60718 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T11:07:00Z |
| publishDate | 2017 |
| publisher | Science Publications |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-607182019-04-29T06:11:06Z http://psasir.upm.edu.my/id/eprint/60718/ A review on heuristics for addition chain problem: towards efficient public key cryptosystems Muhammad Noma, Adamu Muhammed, Abdullah Mohamed, Mohamad Afendee Ahmad Zulkarnain, Zuriati Field exponentiation and scalar multiplication are the pillars of and the most computationally expensive operations in the public key cryptosystems. Optimizing the operation is the key to the efficiency of the systems. Analogous to the optimization is solving addition chain problem. In this study, we survey from the onset of the addition chain problem to the state-of-the-art heuristics for optimizing it, with the view to identifying fundamental issues that when addressed renders the heuristics most optimal mean of minimizing the two operations in various public key cryptosystems. Thus, our emphasis is specifically on the heuristics: Their various constraints and implementations efficiencies. We present possible ways forwards toward the optimal solution for the addition chain problem that can be efficiently applied for optimal implementation of the public key cryptosystems. Science Publications 2017 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/60718/1/A%20review%20on%20heuristics%20for%20addition%20chain%20problem%20towards%20efficient%20public%20key%20cryptosystems.pdf Muhammad Noma, Adamu and Muhammed, Abdullah and Mohamed, Mohamad Afendee and Ahmad Zulkarnain, Zuriati (2017) A review on heuristics for addition chain problem: towards efficient public key cryptosystems. Journal of Computer Science, 13 (8). 275 - 289. ISSN 1549-3636; ESSN: 1552-6607 https://thescipub.com/pdf/10.3844/jcssp.2017.275.289 10.3844/jcssp.2017.275.289 |
| spellingShingle | Muhammad Noma, Adamu Muhammed, Abdullah Mohamed, Mohamad Afendee Ahmad Zulkarnain, Zuriati A review on heuristics for addition chain problem: towards efficient public key cryptosystems |
| title | A review on heuristics for addition chain problem: towards efficient public key cryptosystems |
| title_full | A review on heuristics for addition chain problem: towards efficient public key cryptosystems |
| title_fullStr | A review on heuristics for addition chain problem: towards efficient public key cryptosystems |
| title_full_unstemmed | A review on heuristics for addition chain problem: towards efficient public key cryptosystems |
| title_short | A review on heuristics for addition chain problem: towards efficient public key cryptosystems |
| title_sort | review on heuristics for addition chain problem: towards efficient public key cryptosystems |
| url | http://psasir.upm.edu.my/id/eprint/60718/ http://psasir.upm.edu.my/id/eprint/60718/ http://psasir.upm.edu.my/id/eprint/60718/ http://psasir.upm.edu.my/id/eprint/60718/1/A%20review%20on%20heuristics%20for%20addition%20chain%20problem%20towards%20efficient%20public%20key%20cryptosystems.pdf |