はてなブックマーク

Paper Fermat Factorization in the Wild, background paper published at the Cryptology ePrint Archive. Introduction In 1643 Pierre de Fermat developed a factorization algorithm. The algorithm allows efficiently calculating the prime factors of a composite number that is the product of two "close" primes. The RSA encryption and signature algorithm relies on the fact that factorization of large number