A Textbook RSA implementation in Python

Cryptographic algorithms

Python implementation of RSA cryptosystem showing the encryption and decryption algorithms as well as the possible attacks.

Implementation of the RSA algorithm | Python | Command-line interface | Miller-Rabin | Extended Euclidean algorithm

A modular cryptography engine implementing an optimized ElGamal pipeline with large-prime generation, block-level file encryption, and multithreaded acceleration. Demonstrates practical skills in number theory, security engineering, performance optimization, and high-throughput Python system design

Explanation of the RSA Algorithm

Factoring numbers in Python

Toy Digital Signatures implemented using Public Key Crypto for signing and verification, SHA1 for hashing.

Calculates if a number is composite or PROBABLY prime using the Miller-Rabin algorithm. If the number calculated is more than 10 digits long it could present errors.

Trial division, Fermat, Miller-Rabin, Solovay–Strassen and Lucas primality tests

Pure-Python implementation of the Rabin-Miller primality test.

Toy SFTP implemented using Diffie-Hellmann Key Exchanging, Caesar Cipher for encryption and SHA1 for password hashing.

RSA keys generation in Python

Bibliothèque Python pour la génération et le test de nombres premiers avec des algorithmes optimisés (crible d'Ératosthène, Miller-Rabin) et export CSV.

Implémentation d'algorithmes et analyse de complexité de problèmes

A multithreaded Python3 implementation of Miller-Rabin probabilistic primality testing.

RSA Implementation in Python3 without crypto libs