In Formal Languages, we encounter the concept of automata. They essentially describe what is accepted by a regular language. There are deterministic finite automata (DFA) and non-deterministic fini...

This is a writeup of the 15 easy binary exploitation challenges from picoGym. You can find these challenges at picoGym There’s also an extra challenge at the end from another CTF :) Let’s get start...

This is the part 1 of a study on ZKPs. Part 2 will contain the implementation of these protocols using Circom. What are Zero-Knowledge Proofs? ZK Proofs are exactly what the name implies: proofs of...

RSA-256 RSA-256 Description: Based on the military-grade encryption offered by AES-256, RSA-256 will usher in a new era of cutting-edge security... or at least, better security than RSA-128. Chal...