Update for 31-01-22 14:45
This commit is contained in:
parent
bc4d861f07
commit
277d624613
16
math/primative_root.wiki
Normal file
16
math/primative_root.wiki
Normal file
@ -0,0 +1,16 @@
|
|||||||
|
= Primative root =
|
||||||
|
|
||||||
|
A primative root is some value such that
|
||||||
|
|
||||||
|
```
|
||||||
|
alpha^1 mod q = x,,1,,
|
||||||
|
alpha^2 mod q = x,,2,,
|
||||||
|
alpha^3 mod q = x,,3,,
|
||||||
|
...
|
||||||
|
alpha^q-1 mod 1 = x,,(q-1),,
|
||||||
|
```
|
||||||
|
|
||||||
|
Where x,,n,, is
|
||||||
|
```
|
||||||
|
1, 2, 3, 4, etc
|
||||||
|
```
|
@ -4,3 +4,10 @@ Diffie Helman is a secret sharing algorithm where a shared secret can be
|
|||||||
created between two parties via an unsecure channel.
|
created between two parties via an unsecure channel.
|
||||||
|
|
||||||
* Diffie hellman is not for encryption
|
* Diffie hellman is not for encryption
|
||||||
|
* used to generate private key
|
||||||
|
|
||||||
|
== algorithm ==
|
||||||
|
|
||||||
|
1) For some prime `q`
|
||||||
|
2) Select some `alpha` such that `alpha < q` and `alpha` is a [[../math/primative_root]] of
|
||||||
|
`q`
|
||||||
|
@ -5,9 +5,9 @@ large prime numbers.
|
|||||||
|
|
||||||
== algoirthm ==
|
== algoirthm ==
|
||||||
|
|
||||||
1) choose some p and q
|
1) choose some `p` and `q`
|
||||||
* where p and q are very large primes
|
* where `p` and `q` are very large primes
|
||||||
* n = p * q
|
* `n = p * q`
|
||||||
2) T = (p-1)(q-1)
|
2) T = (p-1)(q-1)
|
||||||
* known as eulers totient
|
* known as eulers totient
|
||||||
3) choose 2 values e and d
|
3) choose 2 values e and d
|
||||||
|
Loading…
Reference in New Issue
Block a user