Integer factorization: Number theory, Composite number, Factorization, Algorithm, Cryptography, Elliptic curve, Algebraic number theory, Quantum computer, RSA problem - Tapa blanda

Sinopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In number theory, integer factorization or prime factorization is the breaking down of a composite number into smaller non-trivial divisors, which when multiplied together equal the original integer. When the numbers are very large, no efficient integer factorization algorithm is publicly known; an effort concluded in 2009 by several researchers factored a 232-digit number (RSA-768) utilizing hundreds of machines over a span of 2 years. The presumed difficulty of this problem is at the heart of certain algorithms in cryptography such as RSA.

"Sinopsis" puede pertenecer a otra edición de este libro.