Very interesting. I wasn't aware of Pocklington. Some other early work in addition to the correspondence between Gödel and von Neumann mentioned in another comm

Very interesting. I wasn't aware of Pocklington. Some other early work in addition to the correspondence between Gödel and von Neumann mentioned in another comment: The French Mathematician Gabriel Lamé noted in 1845 that the Euclidean algorithm for finding the greatest common divisor of two numbers is efficient because the number of steps grows linearly with the number of digits in the input. [1] John Forbes Nash wrote a letter to the NSA discussing applications of what is now known as the P vs NP to cryptography in 1955. The letter was declassified in 2012. [2] [1] Lamé, Gabriel. Note sur la limite du nombre des divisions dans la recherche du plus grand commun diviseur entre deux nombres entiers. 1844. [2] https://www.nsa.gov/portals/75/documents/news-features/declassified-documents/nash-letters/nash_letters1.pdf https://www.nsa.gov/portals/75/documents/news-features/decla...