PT Integer Factorization of Products of Two Large Primes?

[Guest]

PT stands for Polynomial Time. Can we generally factor known products of two large distinct and unknown prime numbers in polynomial time?

Relevant Reference Links:

https://en.wikipedia.org/wiki/Time_complexity#Polynomial_time
[url]
viewtopic.php?f=63&t=1488[/url]

[Guest]

Another Relevant Reference Link:

https://en.wikipedia.org/wiki/RSA_Factoring_Challenge

[Guest]

PT stands for Polynomial Time. Can we generally factor known products of two large distinct and unknown prime numbers in polynomial time?

Relevant Reference Links:

https://en.wikipedia.org/wiki/Time_complexity#Polynomial_time

https://www.math10.com/forum/viewtopic.php?f=63&t=1488

[Guest]

Is there any evidence for integer factorization is in PT?

Answer Link:

https://mathoverflow.net/questions/79366/evidence-for-integer-factorization-is-in-p

Hm... Publicly, the answer is unknown...

[Guest]

Is there any evidence for integer factorization is in PT?

Answer Link:

https://mathoverflow.net/questions/79366/evidence-for-integer-factorization-is-in-p

Hm... Publicly, the answer is unknown...

Relevant Reference Link:

http://www.cs.columbia.edu/~rjaiswal/factoring-survey.pdf