[noter]

currently experimenting with yafu on n. but i think this is to easy for a hard challenge.

---

btw. I think the idea with AES is to reset the key to zero via update_key

[noter]

i have a working example with reduced bit sizes, which uses sagematch factor() to get p, q. all i would need is a high performing rsa moduli factorization with parallel processing capabilities. .... grrrr .....

[Kazukisora]

i have a working example with reduced bit sizes, which uses sagematch factor() to get p, q. all i would need is a high performing rsa moduli factorization with parallel processing capabilities. .... grrrr .....

hey guy's i found a  method to get r value and set the key to 2 r making it just zeros so the las step is to get the p and q from the factorziztion of A and C such that n = Ar2 + Br + C  but am still facing trouble with the last factorization step of C and A i can factorize C is relatively small also A << n but A > C  if any body wanna work with me send me a  dm