Crypto Primatives: Difference between revisions
Jump to navigation
Jump to search
Adamcolton (talk | contribs) |
Adamcolton (talk | contribs) No edit summary |
||
| Line 7: | Line 7: | ||
I think it only allows for key exchange. | I think it only allows for key exchange. | ||
The cycle length (order) is 2^252 + 27742317777372353535851937790883648493 | |||
== Primes == | == Primes == | ||
Also form a Galois Field with a hard discrete log. | Also form a Galois Field with a hard discrete log. | ||
Revision as of 10:34, 21 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.
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.