{'fraction_non_alphanumeric': 0.017509727626459144, 'fraction_numerical': 0.0, 'mean_word_length': 5.638709677419355, '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}}
Review of Elliptic Curve Processor architectures

Several Elliptic Curve Processors (ECP) have been proposed in the literature associated with various architectures using different and sometimes confusing terminologies. This paper is a short review study of ECP architectures, considering the hardware platforms used for their implementations. The main design parameters of the ECP architectures, including the field choice and scalar multiplication algorithms were identified. Based on these parameters, a statistical study is conducted on a large collection of the published work. From the analysis of the collected data, several conclusions were deduced, such as the notion that binary field is easier to be implemented in hardware than prime field as well as the polynomial basis is dominant over other bases representation. Another significant conclusion is that Montgomery scalar multiplier has been used more than Lopez-Dahab, Binary, and NAF methods, particularly with the dominance of Lopez-dahab Projective coordinate.