{'fraction_non_alphanumeric': 0.014184397163120567, 'fraction_numerical': 0.016548463356973995, 'mean_word_length': 5.416666666666667, '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 reconfigurable processor for high speed point multiplication in elliptic curves

This paper presents a generic architecture for the computation of elliptic curve scalar multiplication over binary extension fields. In order to optimise the performance as much as we could, we designed a parallelised version of the well-known Montgomery point multiplication algorithm implemented on a reconfigurable hardware platform (Xilinx XCV3200). The proposed architecture allows the computation of the main building blocks required by the Montgomery algorithm in an efficient manner. The results achieved show that our proposed design is able to compute GF(2191) elliptic curve scalar multiplication operations in just 22 clock cycles at a frequency of about 10 MHz. Moreover, our structure is able to obtain a scalar multiplication in less than 60 µSecs.