1.2c rsa done

.gitignore

@@ -0,0 +1 @@
+__pycache__/

README.md

@@ -0,0 +1 @@
+# Assignments for Spring 2024 CSE548 - Advanced Computer Network Security at ASU

hw1.2/answer.txt

@@ -19,3 +19,6 @@ b - julia
 gzip header includes filename. filename is 14 chars, key is 12 chars, so first and thirteenth character have same key byte, get rotation from that and then 
 (the thing has a space at the end lol, also intentional typos?)
 All work and no play makes Jack a dull boy.All work and no play makes Jack a dull boy.All woRk and no play makes Jack a dull boy.All work and ho play maoes Jack a dull boy.All work and no plAy makes Jack a dull boy.Alk work and no plAy makes Jack a dull boy.All work and no play makes Jack a dull boy.All work and no pLay maksa Jack a dull boy.All work and no play makes Jack a dull boy.All 
+
+c - rsa
+ater intrusion detection systems used adaptive meth-ods involving neural networks and Petri nets to improve their detection abilities.One system, IDIOT [538], monitors audit logs looking for a sequence ofevents that correspond to an attack. An alternative point of view, used by the STATsystem [456], is to ignore the actual states and focus on the commands that changethem. Researchers at the Univer

hw1.2/commontarball/buildkey-givetostudents.py

@@ -9,7 +9,7 @@ def wrap64(string):
     return '\n'.join(textwrap.wrap(string,64))
 
 bitsknownint = 0
-
+prev_tryabit, prev_i = 0, 255
 for line in fileinput.input():
     if len(line) > 10:
         firstline = line
@@ -21,8 +21,12 @@ for line in fileinput.input():
     tryabit = hint & 1
     i = hint >> 1
 # All you have to do is figure out what YYY and ZZZ should be...
-    if (YYY):
+    if(i != prev_i):
-        ZZZ
+        bitsknownint = (bitsknownint << 1) | prev_tryabit
+    prev_tryabit, prev_i = tryabit, i
+
+# putting in the right order
+bitsknownint = int("{0:b}".format(bitsknownint)[::-1],2)
 
 #while (len(bitsknown) < 256):
 #    i = 255 - len(bitsknown)