An Algorithm for Fame and Wealth!

There's a mathematical problem that, if solved, would bring you fame and glory, as well as completely disrupt the global landscape of cybersecurity. Before we get to the problem, I recommend watching two significant videos: Da qui passiamo ci avviciniamo sempre di più al problema: Eccoci al problema…..rileggi attentamente più volte il testo del problema… Given a number N, which is the product of two prime numbers (a*b=N), is there a rule, other than prime factorization, to identify a and b? If we imagine N to be sufficiently large (e.g., a 100-digit number), the attempts to factorize it to find a and b cannot even be made by a computer!!! Let's take an example: 1147 is a non-prime number produced by two prime numbers. Probably, with a few calculations, you can determine which prime factors of N, when multiplied together, can produce N (in this example, 1147). You may have established an algorithm that can factorize a number like 1147 into two prime factors. This is valid for a 4-digit decimal number, which is relatively small. If I gave you a number with 8 digits, you might still be able to do it, but with many calculations…. with 16 digits, the algorithm you used would probably no longer return a solution…. if you got the result, call me immediately….;-)