Crypto Primatives: Difference between revisions
Jump to navigation
Jump to search
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..." |
Adamcolton (talk | contribs) No edit summary |
||
| Line 4: | Line 4: | ||
== Elliptic Curve == | == Elliptic Curve == | ||
ECC uses the curve to form a Galois Field where the discrete log problem is hard. | ECC uses the curve to form a Galois Field where the discrete log problem is hard. | ||
I think it only allows for key exchange. | |||
== Primes == | == Primes == | ||
Revision as of 17:57, 20 November 2020
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.
Primes
Also form a Galois Field with a hard discrete log.
Feistel Network
Turns a cryptographic hash into a symmetric cipher.