Soluzione software in Java che genera e salva su file i numeri primi con algoritmo di Fermat e algoritmo di crittografia RSA

Cryptographic algorithms

Fermat factors in python with explanation and a example.

A Practical Study and Comparison of Integer Factorization Methods

**Hyperbo** is an open-source python package, a mathematical package that implements arithmetical computations on hyperbola. This work in particular, focuses on research findings on lattice points on hyperbolas in relation with Fermat factorization equation.

C++ implementation of Fermat's factorization attack on RSA. Demonstrates how choosing close prime factors (p and q) compromises RSA security. Features Miller-Rabin primality testing and performance benchmarking.

Ahmed S. Shatnawi, Mahmoud M. Almazari, Zakarea AlShara, Eyad Taqieddin, Dheya Mustafa, RSA cryptanalysis - Fermat factorization exact bound and the role of integer sequences in factorization problem, Journal of Information Security and Applications, Volume 78, 2023, 103614, ISSN 2214-2126, https://doi.org/10.1016/j.jisa.2023.103614

The 5th lab work for the intelligent embedded systems class.

Cryptographic algorithms and attacks in Java 8

Implementing the RSA algorithm for encryption and decryption, and then testing its vulnerability with Pollard's p-1 Algorithm, Pollard's rho Algorithm, and Fermat's factorization Algorithm

Fermat Number Factors and Primality Test

Create a simulation of RSA Cryptographic Attack based on provided encryption code

Course project for EE 720: Number theory and Cryptology

Fermat's factorization method