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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Science Publications
2017
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/60718/1/A%20review%20on%20heuristics%20for%20addition%20chain%20problem%20towards%20efficient%20public%20key%20cryptosystems.pdf http://psasir.upm.edu.my/id/eprint/60718/ https://thescipub.com/pdf/10.3844/jcssp.2017.275.289 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|