Questions(asked previously) - Dec/20:
- What's the math behind qubit measurement?
- How feasible do you think your project is?
- Briefly explain shor's algorithm.
$Key = 92,48,90,2,7,5,1,9,8,8,6,75,39,2,45,6,3,7,7,20,56,71,5,5 | |
$encoded = "76492d1116743f0423413b16050a5345MgB8AFkAcwAyAG0AQQA2AGgAcABEADYAQgBIAEcAUwBFAE4AYgBiAHEATQAxAEEAPQA9AHwAYgA2AGEAYwA1ADUAOQAwADMAYQAyADkANwBlADkANwBhADEANgAxADQAOABkAGYAOAA5AGMANgBlADEAOQBjADQANwAzAGQANAA4ADQAYQAwADMAOQAxADUAOQBmAGEAZgA5ADgAYwBiADcAYwBiADAAYwBmAGEAMQA1ADQANQA2ADUAYgA5AGUAYwBlADIANgA4ADAAMAA5AGQAOQAzADMANwBiADMANAA4ADkAMQA3ADgAZABlADAAMQA0ADkAZQA2ADMAMwBhADAAMwBjADgAMQBlADIAYgAzAGYAMgAzAGMAZAA5ADIAYwAzADEANwA0ADkAYQA3AGYAMABkADkAYwA2ADkANQAyADUAOAA3AGYAZQA5AGMAMwAwADEANQAzAGEAMAA4AGIAMgBjAGIAZABiADkAMgAzAGQAMAA=" | |
(New-Object System.Net.NetworkCredential("", (ConvertTo-SecureString -k $Key $encoded))).Password |
from z3 import * | |
st = [BitVec(f'{i}', 8) for i in range(0x27)] | |
s = Solver() | |
s.add(st[0x00]^st[0x02]^st[0x04]==0x60) | |
s.add(st[0x04]^st[0x06]^st[0x08]==0x36) | |
s.add(st[0x08]^st[0x0a]^st[0x0c]==0x71) | |
s.add(st[0x0c]^st[0x0e]^st[0x10]==0x32) | |
s.add(st[0x10]^st[0x12]^st[0x14]==0x3f) | |
s.add(st[0x14]^st[0x16]^st[0x18]==0x01) |
#!/usr/bin/env python3 | |
import angr | |
import claripy | |
if __name__ == '__main__': | |
print("[+] Solver Started") | |
binary = "./babymix" | |
flag_length = 0x16 |
Questions(asked previously) - Dec/20:
r%uD 92AA6?[ AC:K6D 5:D2AA62CW2 76H @7 E96>X] | |
x7 J@F 2C6 2??@F?4:?8 D@>6E9:?8[ >2<6 DFC6 J@F 5@ E92E 2E E96 6?5 @7 E96 r%u] ~E96CH:D6[ :E CF:?D E96 E6>A6C2>6?E @7 A=2J6CD] |
Privilege level