Comparison of scalar point multiplication algorithms in a low resource device
| Autor: | Nadjia Benblidia, Mohamed Benmohammed, Mohamed Ramdani |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Computational techniques
Multiplication algorithm General Computer Science Scalar point multiplication Computer science Embedded systems Scalar (mathematics) Cryptography 02 engineering and technology lcsh:QA75.5-76.95 Field arithmetic Computational science Public-key cryptography 0202 electrical engineering electronic engineering information engineering Lightweight cryptography Hardware_ARITHMETICANDLOGICSTRUCTURES Elliptic curve cryptography business.industry 020206 networking & telecommunications Computational complexity Elliptic curve Finite field 020201 artificial intelligence & image processing lcsh:Electronic computers. Computer science business |
| Zdroj: | Journal of King Saud University: Computer and Information Sciences, Vol 32, Iss 4, Pp 425-432 (2020) |
| ISSN: | 1319-1578 |
| DOI: | 10.1016/j.jksuci.2019.07.013 |
| Popis: | Since it was invented, Elliptic Curve Cryptography (ECC) is considered an ideal choice for implementing public key cryptography in resource constrained devices, thanks to its small keys. Scalar point multiplication is the central and the complex operation in the cryptographic computations of ECC that requires a lot of optimizations on execution time and energy consumption especially in low computing power devices such as embedded systems. Thus, many scalar point multiplication algorithms are proposed, each using their own computational techniques and mathematical formulas. In this paper, we have combined the computational techniques with some optimized mathematical formulas and we have implemented them on some Elliptic Curves scalar point multiplication algorithms over finite field. The aim of this work is to identify the most efficient algorithm that combine the best computational technique and the mathematical formulas, and consequently offer less-memory requirements and faster field arithmetic operations. The results show that Montgomery ladder algorithm in co-Z addition with update formula gives better results compared to the other algorithms implemented in this paper. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|