Generators for Certain Alternating Groups with Applications to Crypto (1975)

Interesting fact The authors of this 1975 paper wrote it with the intention of designing cryptographic ciphers. Here's the interesting thing : the paper's main theorem is foundational for modern Catalytic computers. To quote the inventors of catalytic computers "Coppersmith and Grossman [CG75] have shown that the class TP(Z 2 , 2 O(n) , O(1)) contains all boolean functions"