mod p a−b=a−b mod p Constructing a new Group Assumed, we use the prime group as Basis: P=C(Z p ) g , A, B , K∈P a=random() A=ga b=random() B=gb K=Ba=Ab So We can use our previous work for doing Diffie-Hellman key exchange: In My Practical Experimets (coding the alg. In python) It worked!
constructed by applying the Template to another Group, we can Cascade it. given( p) Z p ⊂Z a∗b=a∗b mod p a+b=a+b mod p a−b=a−b mod p Given: C0(Z p )=Z p C1(Z p )=C(Z p ) C2(Z p )=C (C (Z p )) C3(Z p )=C (C(C (Z p ))) C4(Z p )=C (C (C(C(Z p )))) C5(Z p )=C (C(C (C (C (Z p ))))) This shows Numbers, Complex numbers and Hypercomplex over various levels.
dont need BigIntegers to offer security • Faster • More portable – They are Quantum-Computer-Hard (Propably) – They are Easier to Implement than Elliptic Curve Diffie-Hellman