mslc.ctf.su Open in urlscan Pro
109.233.61.5  Public Scan

Form analysis
1 forms found in the DOM

GET https://mslc.ctf.su

<form class="searchform" method="get" action="https://mslc.ctf.su">
  <div class="input-group">
    <div class="form-group live-search-input">
      <label for="s" class="screen-reader-text">Search for:</label>
      <input type="text" id="s" name="s" class="form-control" placeholder="Search">
    </div>
    <span class="input-group-btn">
      <button class="btn btn-default" type="submit"><i class="fa fa-search"></i></button>
    </span>
  </div>
</form>

Text Content

 * 

Toggle search form
Search for:

Toggle navigation

More Smoked Leet Chicken

We pwn CTFs

 * Home
 * rfCTF 2011
 * Hack.lu 2010 CTF write-ups
 * Leet More 2010 write-ups

Jul 20


CYBRICS 2020 LITE

 * By vos in Uncategorized

If you haven’t yet registered for our 2020 edition of CyBRICS CTF, you should.

Like previous year, it’s made by SPbCTF meetups crew (guys from MSLC / LC↯BC,
SiBears, PeterPEN, Yozik), and we invite all teams to play.

Unlike previous year, this one is Lite — single online Jeopardy round, everyone
is eligible, and you get prizes without playing Attack-Defense! (which is rare
nowadays)

The same great set of 28 challenges ranging from easy pen-and-paper to
interesting for 24 hours of gameplay. Noobies will have a taste of what CTFs
are, skilled will have fun and check if they can pwn everything the fastest,
competing for the prizes.

Registration open: now
Game is live: July 25th, 2020 10:00 UTC
Game ends: July 26th, 2020 10:00 UTC (24 hours)

Sign up: https://cybrics.net/ (CTFtime page)

Prizes:
1st place: 3 000 USD
2nd place: 2 000 USD
3rd place: 1 000 USD

Additionally, we have a special prize from XCTF League: 1st place gets a spot in
the traditional XCTF Finals 2020 in China, where teams get qualified by winning
other contests.

On top of that, Top-3 teams each get 5 tickets to Positive Hack Days and to
OFFZONE international infosec conventions in Moscow (what are those)

So in just a few words: Online-only, open to all. 28 good old Jeopardy tasks.
July 25th.

 * 2020, ctf, cybrics
 * Leave comment

Sep 30


PWNTHYBYTES CTF 2019 – WRONG RING (CRYPTO)

 * By hellman in Writeups

Is post quantum cryptography too complex for you?

wrong_ring.sage

Summary: Ring-LWE with small error, hidden under a number field

Continue reading

 * 2019, complex, crypto, ctf, number field, ring-lwe, sage, writeup
 * Leave comment

Aug 11


1ST CRYPTO CTF 2019 – LEAST SOLVED CHALLENGES

 * By hellman in Writeups

Brief solution ideas to the least solved Crypto CTF challenges.

Continue reading

 * 2019, crypto, ctf, Edwards, elliptic curves, Fermat factorization, guessing,
   python, rsa, writeup
 * 9 comments

Jul 13


CYBRICS CTF 2019 — WE’RE MAKING A FULL-FLEDGED ONE!

 * By vos in Writeups

We, in SPbCTF meetups crew (guys from LC↯BC, SiBears, PeterPEN, Yozik), were
invited to make a CTF together with some BRICS countries universities.

So we made one — and invite everyone to compete, have fun and win some prizes in
CyBRICS CTF 2019. This one continues the tradition of hack you events, but this
time it won’t be individual. Teams are welcome.

28 challenges ranging from easy pen-and-paper to interesting. Noobies will have
a taste of what CTFs are, skilled will have fun and check if they can pwn
everything the fastest, academic teams will compete for 10 000 USD first place
prize.

Registration open: now
Game is live: July 20th, 2019 10:00 UTC
Game ends: July 21st, 2019 10:00 UTC (24 hours)




Sign up: https://cybrics.net/ (CTFtime page)




Quals Prizes:
Top-5 academic teams from each BRICS country are invited to the on-site
Attack-Defense Finals in St. Petersburg
Top-1 team in Quals gets a spot in XCTF Finals 2019 (September, China).

Finals Prizes:
1st place: 10 000 USD
2nd place: 5 000 USD
3rd place: 3 000 USD

So in just a few words: New CTF by us. 28 good old Jeopardy tasks. July 20th.

 * 2019, ctf, cybrics
 * Leave comment

Sep 14


SECT CTF 2018 :: GH0ST

 * By blackzert in Writeups


ORIGINAL DESCRIPTION:

GH0ST – PWN (468)

Yikes, one of our finest cyberwarrior plugged into the wrong system. His mind is
stuck in the kernel. Bring a plunger and your finest kernel exploit
Service: nc 142.93.38.98 6666 | nc pwn.sect.ctf.rocks 6666
Download: gh0st.tar.gz
Author: likvidera

Summary: linux kernel exploitation using an out-of-bounds kernel memory write.
Continue reading

 * escalation, kernel, linux, lpe
 * 1 comment

Jun 27


MIDNIGHT CTF 2018 FINALS – SNURRE128

 * By hellman in Writeups

In this challenge we have a stream cipher based on LFSR and nonlinear filtering
function. It has 128-bit LFSR secret state and we are also given 1600 keystream
bits. Our goal is simply to recover the key which is the initial state. Here is
the nonlinear filtering function:

f(v) =
v[0] ^ v[1] ^ v[2] ^ v[31] ^ 
v[1]&v[2]&v[3]&v[64]&v[123] ^ 
v[25]&v[31]&v[32]&v[126]

f(v) = v[0] ^ v[1] ^ v[2] ^ v[31] ^ v[1]&v[2]&v[3]&v[64]&v[123] ^
v[25]&v[31]&v[32]&v[126]

We can see that the two nonlinear terms are products of 4 and 5 variables. With
high probability these terms are equal to zero and the filtering function
becomes linear. More precisely, define

L(v) = v[0] ^ v[1] ^ v[2] ^ v[31]

L(v) = v[0] ^ v[1] ^ v[2] ^ v[31]

Then the probability p that f(v)=L(v) equals to 15/16×31/32+1/16×1/32=233/256.
Moreover, for 128 keystream bits the approximation can be expected to hold with
probability p128≈2−17.384 or roughly 1/171000. That is, if we sample 128
keystream bits roughly 171000 times we can expect that once they all are
filtered using the linear function L. Then we can solve the (noiseless) linear
system and recover the key. We can sample bits from the 1600-bit keystream since
we expect that roughly 233/256×1600 of them are filtered using the linear
function and we will succeed once we choose 128 bits out of them. We just need
to know the linear function that maps the original key to each of output
keystream bits (i.e. repeated LFSR step and linear filtering). This can be done
simply by running Snurre with linear filtering function on keys with single bit
set (i.e. basis vectors) and putting the resulting streams into columns of a
matrix.

The solution may take some time, e.g. around 1 hour on a common laptop. But it
can be easily parallelized simply by running multiple instances.

Solution code in Sage

The problem of solving noisy linear equations is called Learning Parity with
Noise (LPN). There are various methods for approaching it. A good recent paper
on this topic is “LPN Decoded” by Esser et al. For example, the described above
method is called Pooled Gauss in the paper.

 * 2018, crypto, ctf, finals, LPN, midnight, python, sage, stream cipher,
   writeup
 * 1 comment

Apr 02


0CTF 2018 QUALS – ZER0C5 (CRYPTO 785)

 * By hellman in Writeups

> 0ops Cipher 4, hope you enjoy it:)
> zer0C4.zip
> nc 202.120.7.220 1234

Summary: related-key attack on weakened variant of RC4

Continue reading

 * 0ctf, 2018, crypto, FMS, python, quals, rc4, stream cipher
 * 1 comment

Apr 02


0CTF 2018 QUALS – ZER0SPN (CRYPTO 550)

 * By hellman in Writeups

> 0ops SPN, hope you enjoy it:)
> zer0SPN.zip

Summary: linear cryptanalysis on toy block cipher

Continue reading

 * 0ctf, 2018, block cipher, crypto, gist, linear, linear cryptanalysis, python,
   quals
 * 4 comments

Apr 02


0CTF 2018 QUALS – ZER0TC (CRYPTO 916)

 * By hellman in Writeups

> 0ops Toy Cipher, hope you enjoy it:)
> zer0TC.zip

Summary: meet-in-the-middle and key-schedule constraints

Continue reading

 * 0ctf, 2018, aes, block cipher, c++, crypto, gist, key schedule,
   meet-in-the-middle, mitm, permutation, pypy, python, quals, SPN
 * Leave comment

Oct 05


HACK YOU ’17 :: EASY CTF ON OCT 8—14

 * By vos in Uncategorized

As a tradition, every fall we host a fun lightweight Jeopardy CTF for our
freshmen to attract them into all the CTFey goodness. This one will be our fifth
year (holy shit!)

We invite everyone to check out hack you ’17 this year. Just as always, two
separate scoreboards: one for SPbCTF meetups, one for everyone on the world. And
yeah, we have some prizes this year!

28 challenges ranging from easy pen-and-paper to interesting. Noobies will have
a taste of what CTFs are, skilled will have fun and check if they can pwn
everything the fastest.

Registration open: now (sign up individually — no teams)
Game is live: October 8th, 2017 18:00 UTC
Game ends: October 14th, 2017 18:00 UTC



Sign up: https://hackyou.ctf.su/



Prizes:
Top-3 in the Overall board get a free ZeroNights 2017 entry each.   
Top-50 in the Overall scoreboard qualify to the Final event in Saint Petersburg
on October 29th.

So in just a few words: Fifth hack you. 28 good old speedhack tasks. October
8th.

 * 2017, ctf, hackyou, school
 * Leave comment

Sep 04


TWCTF 2017 – SOLUTIONS FOR BABYPINHOLE, LIAR’S TRAP, PALINDROME PAIRS CHALLENGE

 * By hellman in Writeups

Scripts with short explanations:

 * BabyPinhole (crypto 163)
 * Liar’s Trap (crypto/ppc 281)
 * Palindrome Pairs – Challenge Phase (ppc 63+337)

 * 2017, crypto, ctf, gists, LLL, optimization, polynomial hash, ppc, python,
   sage, secret sharing, TWCTF, writeup
 * 1 comment

Jul 09


POLICTF 2017 – LUCKY CONSECUTIVE GUESSING (CRYPTO)

 * By hellman in Writeups

> We implemented a random number generator. We’ve heard that rand()’s 32 bit
> seeds can be easily cracked, so we stayed on the safe side.
> 
> nc lucky.chall.polictf.it 31337
> 
> chall.py

Summary: breaking truncated-to-MSB LCG with top-down bit-by-bit search.

Continue reading

 * 2017, bit-by-bit, crypto, ctf, lcg, MSB, polictf, python, truncated, writeup
 * Leave comment

Jun 19


GOOGLE CTF 2017 QUALS – BLT (BLEICHENBACHER’S LATTICE TASK – INSANITY CHECK)

 * By hellman in Writeups

> A slow descent into the dark, into madness, futility, and despair.
> 
> BLT.jar (not necessary)
> STDOUT
> Flag.java

Summary: DSA with short secrets, lattice + meet-in-the-middle attack.

Continue reading

 * 2017, bitCount, Bleichenbacher, BSGS, crypto, ctf, discrete logarithm, DSA,
   google, insanity, java, lattice, LLL, meet-in-the-middle, python, quals,
   sage, writeup
 * 1 comment

Jun 19


GOOGLE CTF 2017 QUALS – CRYPTO WRITEUPS

 * By hellman in Writeups

Scripts with short explanations for all crypto tasks (except RSA) from Google
CTF Quals 2017:

 * Crypto Backdoor
 * Introspective CRC
 * Shake It
 * RSA CTF Challenge (no writeup, but I think it’s similar to this old one)
 * Rubik
 * Bleichenbacher’s Lattice Task (full writeup here)

 * 2017, blake, BSGS, collection, CRC, crypto, ctf, gists, google, lattice,
   Pohlig-Hellman, python, quals, Rubik, rust, sage, short, writeup
 * Leave comment

Mar 20


0CTF 2017 QUALS – ZER0LLVM

 * By hellman in Writeups

> Talent Yang loves to customize his own obfuscator. Unfortunately, he lost his
> seed when he was watching Arsenal’s UEFA game. What a sad day! His team and
> his seed were lost together. To save him, could you help him to get back his
> seed? We can not save the game, but we may be able to find out his seed.
> Compile: ollvm.clang -Xclang -load -Xclang lib0opsPass.so -mllvm
> -oopsSeed=THIS_IS_A_FAKE_SEED source.c
> Clang && LLVM Version: 3.9.1
> link
> flag format: flag{seed}

Summary: deobfuscating and attacking AES parts.

Continue reading

 * 0ctf, 2017, aes, binary, c++, crypto, ctf, linear, llvm, obfuscation, prng,
   python, reverse, sage, state machine, writeup
 * Leave comment

 * 
 * 1
 * 2
 * 3
 * …
 * 14
 * 


ARCHIVES

 * July 2020 (1)
 * September 2019 (1)
 * August 2019 (1)
 * July 2019 (1)
 * September 2018 (1)
 * June 2018 (1)
 * April 2018 (3)
 * October 2017 (1)
 * September 2017 (1)
 * July 2017 (1)
 * June 2017 (2)
 * March 2017 (3)
 * October 2016 (6)
 * September 2016 (3)
 * May 2016 (5)
 * April 2016 (2)
 * March 2016 (5)
 * September 2015 (2)
 * May 2015 (4)
 * April 2014 (4)
 * March 2014 (1)
 * February 2014 (4)
 * January 2014 (2)
 * December 2013 (1)
 * October 2013 (1)
 * June 2013 (6)
 * April 2013 (1)
 * February 2013 (2)
 * November 2012 (6)
 * October 2012 (7)
 * May 2012 (6)
 * April 2012 (2)
 * March 2012 (4)
 * February 2012 (17)
 * January 2012 (12)
 * December 2011 (6)
 * October 2011 (5)
 * September 2011 (10)
 * August 2011 (8)
 * July 2011 (3)
 * June 2011 (5)
 * April 2011 (10)
 * March 2011 (7)
 * January 2011 (2)
 * December 2010 (1)
 * November 2010 (1)
 * October 2010 (11)
 * September 2010 (11)


META

 * Register
 * Log in
 * Entries feed
 * Comments feed
 * WordPress.org


TAGS

0ctf 2010 2011 2012 2013 2014 2016 2017 aes aslr binary bruteforce c++ codegate
crt crypto ctf defcon exploit formatstring gits google hack.lu hacklu hash ictf
leetmore nuit du hack nx pctf plaid plaidctf ppp python quals reverse reversing
rop rsa sage shellcode vm web writeup xor

© 2024 More Smoked Leet Chicken.

Made with by Graphene Themes.