note

Look at the Shift Amount and Correspondence Table First | picoCTF Cryptography Intro 4-Problem Writeup Japanese Explanation

I will provide a summary explanation for four introductory problems from CyLab Security Academy (formerly picoCTF) Cryptography. The problems covered are "Mod 26," "The Numbers," "caesar," and "Easy1.
note

Reversing 23 numbers one by one using the modular inverse of 41 | picoCTF "basic-mod2" writeup Japanese explanation

I will explain three problems from the CyLab Security Academy (formerly picoCTF) Cryptography section. The problems covered are "13", "basic-mod1", and "basic-mod2". All three problems involve ...
GitHub

Learn Python

This course contains lots of challenges for Python, each challenge is a small Python project with detailed instructions and solutions. You can practice your Python skills by solving these challenges, ...
letsdatascience

GPT-6 Astra Decodes 1809 Napoleonic Cipher

Carter Church, an AI engineer at SentinelOne, used OpenAI's GPT-6 Astra to transcribe and decipher a 1809 French military ...
GitHub

brute-force-algorithm

A Python/Tkinter desktop app that calculates the maximum number of reservations using Greedy and Brute Force algorithms, with built-in complexity comparison. "Bruce" a fast ,C-based cybersecurity tool ...