Implementation of multiple low-level algorithms in x86 Assembly, simulating a simplified intrusion detection system with bitmasking, encryption, and pathfinding.
This project demonstrates control flow, bitwise manipulation, and algorithmic problem-solving at the assembly level.
It includes independent modules for access validation, sorting, cryptographic encoding, and maze traversal.
Language: Assembly (x86, NASM syntax)
Focus: Bitwise operations, recursion, encryption, and dynamic data processing
Implements bitmask-based access control.
Each entity has a 24-bit access mask; the function checks if all requested bits (rooms) are allowed, writing 1 for full access or 0 otherwise.
Implements a login handling system:
sort_requests()— sorts requests by admin flag, priority, and username alphabetically.check_passkeys()— detects invalid or malicious passkeys using bit-pattern analysis.
Implements the Treyfer block cipher, performing:
- 10 encryption/decryption rounds on 8-byte blocks
- Substitution via an S-box
- Modular addition, subtraction, and bit rotations
All operations are done in place, modifying the data directly.
Solves a dynamic maze using recursive exploration.
Zoly starts from (0,0) and moves through free cells ('0') until reaching an exit on the bottom or right edge, marking visited cells to avoid backtracking.
- Implemented and optimized algorithms in pure assembly
- Practiced recursion and flow control without high-level constructs
- Designed encryption and pathfinding routines using low-level logic
- Applied bitwise operations and pointer arithmetic to real problems