Added diy RNG_div_all_coprime.py which takes a number and divides it by

all numbers below it that are coprime, then adds it to the keystream

Added correlogram function to autocorrelation.py to iterate
autocorrelation calculation for every time lag up to a limit

Created div_digits.py which is a function to get decimal digits of a
division of two numbers

Renamed keytest1.py to freq_analysis.py

Author: AAK05

RNG_div_all_Coprime.py

@@ -0,0 +1,22 @@
+from div_digits import divide
+from math import gcd
+import numpy as np
+
+def DivAllCoPrimeRNG(limit,dp=100000):
+    data = []
+    v2 = -1
+    for i in range(limit):
+        if gcd(i+1,limit)==1:
+            a = divide(limit,i+1,dp)
+            v1 = np.array(a)
+            if isinstance(v2,int):
+                v2 = v1
+            else:
+                v2 = np.add(v1,v2)
+    data = v2.tolist()
+    print(len(data))
+    return data
+
+from autocorrelation import correlogram
+print(correlogram(DivAllCoPrimeRNG(2011,100000),20))
+    

autocorrelation.py

@@ -1,6 +1,4 @@
 #!/usr/bin/env python3
-import numpy as np
-
 def autocovariance(data,k=1):
     n = len(data)
     mean = sum(data)/len(data)
@@ -14,5 +12,12 @@ def autocorrelation(data,k=1):
     acf = autocovariance(data,k)/autocovariance(data,0)
     return acf
 
-data = [23.4,24.1,44.4,25.5,29.2,37.1,45.0,61.8,56.7,62.3,30.9,69.6,11.0,56.6,83.4,33.9,75.5,87.3,55.4,95.2]
-print(autocorrelation(data,2))
+def correlogram(data,maxk=1000):
+    correlogram = {}
+    for k in range(maxk+1):
+        correlogram[k] = autocorrelation(data,k)
+    return correlogram
+
+
+#data = [23.4,24.1,44.4,25.5,29.2,37.1,45.0,61.8,56.7,62.3,30.9,69.6,11.0,56.6,83.4,33.9,75.5,87.3,55.4,95.2]
+#print(autocorrelation(data,2))

div_digits.py

@@ -0,0 +1,18 @@
+from mpmath import mp
+
+def divide(num1,num2,dp=100000):
+    f = num2//(10*num1) + 3
+    mp.dps = dp+f
+    ans = mp.fdiv(num1,num2)
+    ans_str = str(ans)
+    ans_lst = []
+    index = ans_str.find(".")
+    for char in ans_str:
+        if char == ".":
+            continue
+        ans_lst.append(int(char))
+    ans_lst = ans_lst[index:]
+    while len(ans_lst) <= dp:
+        ans_lst.append(0)
+    return ans_lst[:dp]
+

encryption1.py

@@ -36,4 +36,5 @@ def encrypt(message):
     encrypted = "".join(encrypted_lst_char)
     return encrypted
 
-print(encrypt("Secret Message"))
+if __name__ == "__main__":
+    print(encrypt("Secret Message"))

keytest1.py renamed to freq_analysis.py

@@ -1,11 +1,12 @@
 from encryption1 import generatekey
 
-key = generatekey(100000)
-distribution={}
-for i in key:
-    distribution[i] = distribution.get(i,0) + 1
-print(distribution)
+def freq_analysis(key):
+    distribution={}
+    for i in key:
+        distribution[i] = distribution.get(i,0) + 1
+    return distribution
 
+print(freq_analysis(generatekey(100000)))
 #Frequency analysis of pi digits
 """
 from pi import pi