Rating:

Shift VFKGGPTEKQYCBLLONRLGWKOQCDJMAYQCNPDZQQQ by n=44:

This is what you get when you netcat to the server, which is just a normal netcat question Creating the fibonacci sequence in this case will take too long for the 60 second time limit as I found out, so after googling around I found out that creating a list of fibonacci sequence numbers will allow me to access the numbers exponentially faster. Since we know the upper limit of the sequence, which is less than fifty, creating a list to that limit will allow us to solve this question easily.

Original writeup (https://github.com/darkvoid32/CTF-writeups/tree/master/%C3%A5ngstromCTF%202020/Shifter).