| 释义 |
integer factorization (in cryptography) While the Fundamental Theorem of Arithmetic states that any number can be written uniquely as a product of prime factors, there is no known efficient factorization algorithm for very large numbers. The difficulty of factorizing large composite integers, especially semiprimes, lies at the heart of many modern secure systems of data transmission such as RSA.
|