LABYRINTH© is an encryption algorithm with an internal state of 1,000,000 bytes that continuously evolves during encryption. The architecture is public: the full technical documentation is available below.
Anyone today may need to encrypt information — to protect their own data, or to communicate privately at any level. LABYRINTH©, while a robust system, is designed to be easy for anyone to use, not just cryptography experts.
LABYRINTH© does not use a fixed substitution table. Its internal state — a million bytes — continuously evolves during encryption, driven by three parameters derived from a 512-bit key. The same byte, encrypted twice, never produces the same result.
The entire architecture is public. We don't ask anyone to trust the secrecy of the mechanism — only the key, as required by Kerckhoffs's principle, the foundation of serious cryptography since 1883.
«A cryptographic system's security must reside in the key, not in the secrecy of the algorithm.» — Auguste Kerckhoffs
For the complete technical documentation — state structure, evolution function, encryption formulas — see the Documentation section.
Regulation and public submission log, available for anyone who wants to try.
To register: labyrinth-chall@proton.me (see Article 4 of the Rules for the registration procedure).
↓ Download the challenge materials and rules ↗ Submission repository (GitHub) ↓ Download the encrypted challenge file ↓ Download LABYRINTH-CHALLENGE-KEY W-NIDE: 3.5644.1202.6741.2199The algorithm's complete architecture and the app to use it, available to anyone.
The application for encrypting and decrypting files with the LABYRINTH© algorithm.
How to install, encrypt, decrypt, and manage keys with QUELON — step by step.
↓ Download the manualState structure W, Y/K/Z derivation, evolution function, encryption and decryption formulas.
↓ Download PDF/DOCX (English)