New quintupling point arithmetic 5P formulas for Lŏpez-Dahab coordinate over binary elliptic curve cryptography
In Elliptic Curve Cryptography (ECC), computational levels of scalar multiplication contains three levels: scalar arithmetic, point arithmetic and field arithmetic. To achieve an efficient ECC performance, precomputed points help to realize a faster computation, which takes away the need to repeat t...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
Science and Information Organization
2019
|
| 在線閱讀: | http://psasir.upm.edu.my/id/eprint/81471/1/New%20quintupling%20point%20arithmetic%205P%20formulas%20for%20L%C5%8Fpez-Dahab%20coordinate%20over%20binary%20elliptic%20curve%20cryptography.pdf http://psasir.upm.edu.my/id/eprint/81471/ https://thesai.org/Publications/ViewPaper?Volume=10&Issue=7&Code=IJACSA&SerialNo=54 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | In Elliptic Curve Cryptography (ECC), computational levels of scalar multiplication contains three levels: scalar arithmetic, point arithmetic and field arithmetic. To achieve an efficient ECC performance, precomputed points help to realize a faster computation, which takes away the need to repeat the addition process every time. This paper introduces new quintupling point (5P) formulas which can be precomputed once and can be reused at the scalar multiplication level. We considered mixed addition in Affine and Lŏpez-Dahab since the mixed addition computation cost is better than the traditional addition in Lŏpez-Dahab coordinates over binary curve. Two formulas are introduced for the point quintupling which (Double Double Add) and (Triple Add Double), the cost of the two formulas are 17 multiplication+12 squaringand 23 multiplication+13 squaring respectively. The two formulas are proven as valid points. The new quintupling point can be implemented with different scalar multiplication methods. |
|---|