I keep reading all these descriptions that say John Forbes Nash Jr anticipated the P/NP problem in some letters to the NSA but other people say his conjecture was kind of obvious and basically Shannon already had it. What do you think @SteveBellovin and @mattblaze?
-
-
"the mean key computation length increases exponentially with the length of the key"
-
Yeah. But when you think about it, this conjecture is basically the existence of one way functions. Unfortunately he doesn’t really capture any of the implications.
-
Noam Nisan talks about this here: https://agtb.wordpress.com/2012/02/17/john-nashs-letter-to-the-nsa/ … Interestingly Godel in 1956 also talked about PvsNP in a letter to von Neumann
-
And Godel’s description is only a little bit more complex than what Nash wrote.
-
But then Shannon in 1949 does say a few things about complexity.pic.twitter.com/MWPTh9D7wT
-
That seems like a description of security reductions in the third paragraph
-
What percentage of modern cryptography could have been invented during the 1950s if all these people had been brought together in a room. I wonder what percentage *was* invented and it’s all still classified.
- 2টি আরও উত্তর
নতুন কথা-বার্তা -
-
-
I was wrong about not classifying: "So a logical way to classify enciphering processes is by t he way in which the computation length for the computation of the key increases with increasing length of the key"https://twitter.com/zkproofs/status/1019682688280612864 …
ধন্যবাদ। আপনার সময়রেখাকে আরো ভালো করে তুলতে টুইটার এটিকে ব্যবহার করবে। পূর্বাবস্থায়পূর্বাবস্থায়
-
লোড হতে বেশ কিছুক্ষণ সময় নিচ্ছে।
টুইটার তার ক্ষমতার বাইরে চলে গেছে বা কোনো সাময়িক সমস্যার সম্মুখীন হয়েছে আবার চেষ্টা করুন বা আরও তথ্যের জন্য টুইটারের স্থিতি দেখুন।