In this paper, we propose an efficient and secure scalar multiplication method by partitioning the bit string of the scalar in half and extracting the common substring from the two parts based on ...

``abcdef`` and ``xabded`` have two longest common substrings, ``ab`` or ``de``. Therefore, algorithm should return any one of them.