Hacker News
- John Nash 1955 on basing cryptography on exponential difficulty http://www.gwern.net/docs/1955-nash 2 comments
Linked pages
- Prisoner's dilemma - Wikipedia https://en.wikipedia.org/wiki/Prisoner's_dilemma?wprov=sfti1 266 comments
- Game theory - Wikipedia https://en.wikipedia.org/wiki/Game_theory 145 comments
- Squaring the circle - Wikipedia https://en.wikipedia.org/wiki/Squaring_the_circle 32 comments
- Entropy (information theory) - Wikipedia https://en.wikipedia.org/wiki/Entropy_(information_theory)#Entropy_as_a_measure_of_diversity 16 comments
- Huffman coding - Wikipedia https://en.wikipedia.org/wiki/Huffman_coding 12 comments
- NP-hardness - Wikipedia https://en.wikipedia.org/wiki/NP-hardness#Application_areas 6 comments
- Kerckhoffs's principle - Wikipedia http://en.wikipedia.org/wiki/Kerckhoffs's_principle 5 comments
- NP-hardness - Wikipedia https://en.wikipedia.org/wiki/NP-hard 5 comments
- Linear programming - Wikipedia https://en.wikipedia.org/wiki/Linear_programming 5 comments
- National Security Agency - Wikipedia http://en.wikipedia.org/wiki/national_security_agency#history 3 comments
- Merkle–Hellman knapsack cryptosystem - Wikipedia https://en.wikipedia.org/wiki/Merkle%E2%80%93Hellman_knapsack_cryptosystem 3 comments
- Nobel Memorial Prize in Economic Sciences - Wikipedia http://en.wikipedia.org/wiki/nobel_memorial_prize_in_economic_sciences 2 comments
- Linear-feedback shift register - Wikipedia https://en.wikipedia.org/wiki/Linear-feedback_shift_register 0 comments
- Computational complexity theory - Wikipedia https://en.wikipedia.org/wiki/Computational_complexity_theory 0 comments
Related searches:
Search whole site: site:www.gwern.net
Search title: John Nash on cryptography · Gwern.net
See how to search.