Digital encryption doesn’t depend on promises, but on immutable mathematics. The first useful form of encryption was made possible by the RSA algorithm, publicly described in 1977, which hinges on how difficult it is to find the two prime factors that must be multiplied to create a particular extremely large number. Since then, other algorithms have used all manner of obscure mathematics to create other hard-to-crack encryption codes.