Linear-feedback. Shift. Register.
90 points Hard

Hello!

I have just implemented a super-cool PRNG!

I've used every next generated by it number to XOR every next character in my super-secret message with.

Are you able to retrieve it?

Btw. Biggest possibly generated number by my PRNG is 255.

Psst. The retrieved message would be your flag!

As always, starting with: CTFlearn{...

I'm giving you the PRNG scheme with a brief description (description.png) and a "secretMessage.hex" file with every byte being the corresponding message char inside PRNG.zip file.

PRNG.zip
Flag
Rating 4.83
5
4
3
2
1

Discussion

done, had a good time understanding the LFSR and solving it manually, soon when i complete all the cryptography im gonna share the writeups on my website: reznov.is-great.org

1
Protected
1

Wiki title. Once you fully understand the idea of the N mask, you can solve by trial and error with python string and xor skills. You should also be fluid in representing ascii strings in binary format to see what is happening with patterns...

0
Protected
3

Great solution :)

1

Very good challenge

1

Thank you :)

1

remember format of the flag

1

The nice one! We have to do many steps by hand to find the seed key

2

Thanks! It depends on an approach ;)

1