Looking for an expert on RSA Modulo Decomposition -- 3

Hello! I am looking for an expert on RSA modulo decomposition. Specifically, Please keep in mind that what I need is an expert in this field, I know it is very difficult to decompose a large number of prime factors, but this is all theoretical, I hope you have fully experimented with RSA decomposition, such as using multiple attacks and using A large number of computers have done this experiment, not just theory, theory is only the basis, I need help generating primes, and the complexity requirements are flexible. The programming language I would prefer to use for the solution is Python. This project is suited for someone with a deep understanding of cryptography and the mathematics associated with it. If this is you, please get in touch and let me know how you can help me solve my problem. Thank you!