New quintupling point arithmetic 5P formulas for Lŏpez-Dahab coordinate over binary elliptic curve cryptography

• المؤلفون الرئيسيون: Abdul Raheem, Waleed Khalid Amin, Md Yasin, Sharifah, Udzir, Nur Izura, Kamel Ariffin, Muhammad Rezal
• التنسيق: مقال
• اللغة: 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 t...