Pseudo-free families and cryptographic primitives (Q2154466)

A family of \(\Omega\)-algebras is called computational if the elements are represented by bit strings in such a way that equality testing, the fundamental operations and generating random elements can be performed efficiently. The author claims that in the variety of all mono-unary algebras exist pseudo-free families of computational mono-unary algebras with an injective operation iff one-way families of permutations exist.