대나무젓가락
@csapp3e
Followers
111
Following
421
Media
7
Statuses
122
KAIST'23, GoN'23 / https://t.co/97ci9Tpvio
Korea
Joined April 2023
model names are so long that designers make scrolling animations for them
65
53
2K
We HypeBoy topped Plaid CTF 2024! 👑 @_Reinose_en @justlikebono @munsiwoo @real_as3617 @mhibio_ptw @howdays1 @stanzz @soo_sudo @n1net4il @1nteger_c @c2w2m2 @pr0cf51 @cmy981224 @csapp3e ironore15 G0RiYa Thanks to the great support from dakuo & hellsonic
0
14
69
next time create efficient backdoor not to get caught
software engineers will notice half a second of latency in something that should be ~instant and will move heaven and earth to fix it, or at least to understand why; and this seems to have blown an operation that had started to install a backdoor on every Debian/Ubuntu SSH server
0
0
0
Wow. A bug in the Seaborn data visualization software hid many CD=1 papers, leading Park et al to incorrectly conclude that disruption in science and technology is declining (top histogram), while it is not ( bottom histogram). @VincentGinis
Ouch, could it be, that a scandalous patter of disruptiveness decline be explained by specifics of pre-processing of the data? https://t.co/xc4iBsxIII what do you think @svalver ?
19
179
850
It's 779 bytes! I thought a tweet is 260 bytes, so did my best to make it under 780 bytes. Looks I didn't have to though :/
0
0
0
a=0n;p=P[l='length'],q=Q[l],k=(1<<30)*4,Q=await A(Q,(X=x=>W(x%L&&L-x%L))(q),P,X(p),new T([q,q/k,p,p/k]));for(I=0;Q[I]+1;I+=L)a=(a+F(Q,I)+(1n<<128n))*r%((1n<<130n)-5n);a+=F(Y,L);return[P,W(L).map(t=>(r=a%Z,a/=Z,`${r}`))]}
1
0
2
,W,Z)))((M=i=>i*4+((J/4&1&&i)+J)%4)(3),M(2),M(1),J++%4)+D()))();for(i=L;i;O[--i]+=R[i]);U=Uint8Array;O=await A(O);P=I?P:W(P);Y=I<0?O:Y;for(i=0;i<64;i++)P[I++]^=O[i]}while(P[I]+1);r=(F=(a,i,j)=>(j??=L)?BigInt(a[i])+F(a,i+1,--j)*(Z=256n):0n)(Y,0)&0xffffffc0ffffffc0ffffffc0fffffffn;
1
0
2
encrypt=async(P,Q,K,N)=>{I=-64;do{T=U=Uint32Array,J=0;O=await(A=async(...V)=>W(await(new Blob(V)).arrayBuffer()))("expand 32-byte k",K,(W=x=>new U(x))([I/64+1]),N),R=O.slice(),(D=b=>(S=[7,8,12,L=16],J<80&&(B=(W,Z,Y,X)=>(s=S.pop())&&(w=O[W]^=O[X]+=O[Y],O[W]<<=s,O[W]|=w>>>-s,B(Y,X
1
0
2
I've just implemented ChaCha20-Poly1305 in JavaScript, fitting it into 3 tweets. Couldn't make it fit into a single tweet, but I think it's impossible 😅 // Usage: // All parameters are Uint8Array // Nonce should be 12 bytes await encrypt(plaintext, aad, key, nonce)
Elon Musk kind of ruined Twitter for this, but I was reminded of an old challenge: write a modern cipher (encryption) in a single (280 character) Tweet. Can we get authenticated encryption?
1
6
20
I came across this puzzle at 1AM. At that time, I thought it was a good pre-sleep puzzle, and it kept me up until 11AM when I finally solved it lmao It's very fun, so give it a try:
curta.wtf
A CTF protocol, where players create and solve EVM puzzles to earn NFTs.
2
1
19
Ok I found the TU Darmstadt paper that initially disclosed the flaws. TL;DR user hashing to implement a (bad) private set intersection protocol, and its trivially vulnerable to brute-force dictionary attacks. Apple has known since 2019! https://t.co/Kz7xNBDUth
2
27
62
LLMs are incredible! The highlighted statement below implies the Riemann hypothesis. (Not a joke.)
34
73
2K
It might be a little bit late, but these are the writeups for the challenges I solved (babywaf, cgi-2023, Plain Blog, DOMLeakify): https://t.co/8OajSGvZKt
hackmd.io
Recently, I participated in SECCON CTF 2023 Finals,as the team “HK Guesser”! We placed 5th with 2206 points in the international division.
2
11
30