1975 paper : Generators for Certain Alternating Groups With Applications to Cryptography

Interesting fact This 1975 paper proved that secure cryptographic ciphers could be made using simple boolean rotations (like in SHA256) Here's the interesting thing : the paper's main theorem is also foundational for modern Catalytic computers. To quote the inventors of catalytic computers ''Coppersmith and Grossman [CG75] have shown that the class TP(Z2 , 2o(n) , O(1)) contains all boolean functions". submitted by /u/DataBaeBee [link] [comments]

from hacking: security in practice https://ift.tt/rDzSlmV