{'fraction_non_alphanumeric': 0.01990049751243781, 'fraction_numerical': 0.0, 'mean_word_length': 5.822033898305085, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A modular design of elliptic-curve point multiplication for resource constrained devices

Elliptic curve cryptography (ECC) is a good candidate for protecting secret data on resource constrained devices. FPGA-based implementations of its main operation, i.e., scalar point multiplication, have gained popularity for their apparent speed advantage over the software counterparts. This paper presents a simple design of point multiplication that minimizes the occupied FPGA resources while maintaining an acceptable timing performance. This is achieved by employing Montgomery ladder algorithm in the projective field, simplest arithmetic units and optimized schedule for the operations. Due to the modular design approach adopted, our design can be easily adapted to different implementation requirements.