The most widely used algorithm in this field is an implementation of a substitution-permutation network.
The Goldreich-Goldwasser-Micali construction is used in this field to construct a PRF from a PRG. The most widely used algorithm in this field is an implementation of a substitution-permutation network. In this field, Luby and Rackoff showed that the Feistel permutation can be used to transform a PRF into a PRP. A hardcore predicate is used by this field's Blum-Blum-Shub algorithm, which is used to generate pseudorandom numbers. If integer factorization could be done in polynomial time with Shor's algorithm, this field's public-key RSA algorithm, an example of a function that is easy to compute but hard to invert, would be totally screwed. For 10 points, identify this field of computer science concerned with encrypting information.
The Goldreich-Goldwasser-Micali construction is used in this field to construct a PRF from a PRG.
cryptography [or cryptology; prompt on computer science]