{'fraction_non_alphanumeric': 0.018820577164366373, 'fraction_numerical': 0.0, 'mean_word_length': 4.824817518248175, '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 Fast {Java} Implementation of a Provably Secure Pseudo Random Bit Generator Based on the Elliptic Curve Discrete Logarithm Problem

We present a pseudo random bit generator whose security is based on the intractability of the discrete logarithm problem in the group E(Fp) of rational points on an elliptic curve over a finite prime field Fp. The bit generator is implemented within the framework of the Java Cryptography Architecture (JCA). It uses an elliptic curve E chosen such that both E(Fp) and its twist E (Fp) are of prime order and cryptographically strong. We show how to efficiently find such curves. As attacking the bit generator is at least as difficult as the elliptic curve discrete logarithm problem we propose to use it for generating key pairs for elliptic curve cryptography.