{'fraction_non_alphanumeric': 0.015434606011372868, 'fraction_numerical': 0.0008123476848090983, 'mean_word_length': 5.253807106598985, '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 survey on elliptic curve cryptography

Cryptography is an evolving field that research into discreet mathematical equation that is representable by computer algorithm for providing message condentiality. The scheme has been widely used by nation-states, corporates and individual who seeks privacy for data in storage and during transmission. This paper provides a ground up survey on elliptic curve cryptography. It tailors the mathematics behind elliptic curve to the applicability within a cryptosystem. In brief, elliptic curve is a study of points on two-variable polynomials of degree 3. With curve dened over a finite field, this set of points acted by an addition operation forms a finite group structure. Also known as torsion points, they are used to represent the coded messages. Encryption and decryption transform a point into another point in the same set. Besides providing conceptual understanding, discussions are targeting the issues of security and efficiency of elliptic curve cryptosystem. This paper serve as a basis in guiding anyone interested to understand the fundamental concept behind this cryptosystem. Moreover, we also highlight subareas of research within the scope of elliptic curve cryptosystem.