Crypto Primatives

From Adam Colton
Revision as of 17:56, 20 November 2020 by Adamcolton (talk | contribs) (Created page with "== 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 har...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.

Primes

Also form a Galois Field with a hard discrete log.

Feistel Network

Turns a cryptographic hash into a symmetric cipher.

Retrieved from "https://wiki.adamcolton.net/index.php?title=Crypto_Primatives&oldid=8459"