P = NP and digital security? Guys how would

g/computerscience

1mo

ago

public

earned

reactions

P = NP and digital security?

Guys how would digital security fail if P=NP is proven?

I just started reading about Turing Machine and computational complexity for my Theory of Computation class and came across that phrase.

I couldn't find anything understandable at my level. So can anyone simplify it a bit?
#technology
source

	earnings
	2,000 mlx total
	$0 total

	engagement
	3 views
	0 reactions

P = NP and digital security? Guys how would digital…

0 comments