{'fraction_non_alphanumeric': 0.014925373134328358, 'fraction_numerical': 0.016282225237449117, 'mean_word_length': 5.15, '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}}
Design and implementation of arithmetic processor F/sub 2//sup 155/ for elliptic curve cryptosystems

Since Diffie and Hellman first introduced the concept of public key cryptography in 1976, the potential usage of discrete logarithm problems in public key cryptosystems has been recognized. Then, in 1985, ElGamal proposed a public key cryptosystem scheme based on this problem. Elliptic curve cryptosystems is a cryptosystem that is based on discrete logarithm problems but using the elliptic curve group so it is more difficult than the discrete logarithm problem itself. In this paper we will describe how to design and implement an arithmetic processor with an efficient architecture and apply it to the elliptic curve cryptosystem.