i bet 100% of users dont understand this statement: Can integer factorization be solved in polynomial time on a classical computer?

[_MVP_]

.

 

[_MVP_]

RL, u idiot.

 

[Deleted member 67937]

That's useless information, waste of neuron storage

 

[Deleted member 88079]

the "you're so smart" validation ur looking for is outside, IRL

 

[Deleted member 100722]

.

I'd say probably not, otherwise asymmetric cryptography would be fucked. This is the holy grail of crypto-crackers, and I cannot imagine how many man-hours of extremely intelligent people have been sunken into this problem. Whoever finds an algorithm requiring only polynomial time would instantly be forcibly recruited by the NSA or killed.

 

[_MVP_]

I'd say probably not, otherwise asymmetric cryptography would be fucked. This is the holy grail of crypto-crackers, and I cannot imagine how many man-hours of extremely intelligent people have been sunken into this problem. Whoever finds an algorithm requiring only polynomial time would instantly be forcibly recruited by the NSA or killed.

u understand the problem?

 

[Deleted member 100722]

u understand the problem?

The problem is, in plain terms, whether there is a method (an algorithm) that can find the prime factors of any non-prime integer (integer factorization) that is sufficiently fast (runs in polynomial time).

And figuring this out is super hard.