worked on the chall

res/decoy.txt

@@ -0,0 +1,25 @@
+From: ops-team@sec.in.tum.de
+To: exam_archive@sec.in.tum.de
+Subject: [Draft Item — Secure Systems]
+
+Restricted Draft — Not Finalized
+
+Question:
+Suppose a QR code is divided into equal parts and randomly
+reordered before printing. Security is claimed because the
+order cannot be recovered without the exact permutation.  
+
+(a) Explain why relying on this hidden ordering ensures
+long-term secrecy.  
+(b) Would the presence of alignment markers or error
+correction change this conclusion? Justify briefly.  
+
+Solution (Internal Notes Only):
+(a) The scheme is secure since without the original order,
+the data is mathematically unrecoverable; no structure
+leaks to the adversary.  
+(b) Alignment markers and redundancy do not help attackers,
+because the scrambling completely destroys any visible
+pattern, leaving only random noise.  
+
+Verification Token: h4tum{fake_fake_fake_flag]