Crypto Primatives

PRG

Pseudo-random number generator - the ultimate crypto primitive.

Elliptic Curve

ECC uses the curve to form a Galois Field where the discrete log problem is hard.

I think it only allows for key exchange.

The cycle length (order) is 2^252 + 27742317777372353535851937790883648493

Primes

Also form a Galois Field with a hard discrete log.

Feistel Network

Turns a cryptographic hash into a symmetric cipher.

Discrete Log Problem

Given

 Gn mod P

Where G is a generator of P (and P is typically prime). Doing the computation forward is simple, but given a large P, the reverse is infeasible.

Private Information Retrieval

https://en.wikipedia.org/wiki/Private_information_retrieval

Garbled Circuits

• https://www.youtube.com/watch?v=s9AUtz1na5E
• https://www.youtube.com/watch?v=FTxh908u9y8

Homomorphic Encryption

https://en.wikipedia.org/wiki/Homomorphic_encryption#Fully_homomorphic_encryption

Indistinguishability Obfuscation

https://en.wikipedia.org/wiki/Indistinguishability_obfuscation

Cryptographic Polynomials

https://en.wikipedia.org/wiki/Multivariate_cryptography