Crypto Primatives: Difference between revisions
Jump to navigation
Jump to search
Adamcolton (talk | contribs) No edit summary |
Adamcolton (talk | contribs) |
||
| Line 6: | Line 6: | ||
I think it only allows for key exchange. | I think it only allows for key exchange. | ||
For 25519 I'd really like to know the cycle length. | |||
== Primes == | == Primes == | ||
Revision as of 18:23, 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.
For 25519 I'd really like to know the cycle length.
Primes
Also form a Galois Field with a hard discrete log.
Feistel Network
Turns a cryptographic hash into a symmetric cipher.