2 votes

Is it possible to use Diffie-Hellman protocol for symmetric group?

In the question, a symmetric group is the set $S_n$ of permutations of $n$ things. $S_n$ has $n!$ elements. It's internal law noted  $\circ$  is function composition: $w=u\circ v$ is defined by $w(i)=...
fgrieu's user avatar
  • 141k
1 vote
Accepted

A simple guide to Diffie-Hellman Key Exchange including the what, the how and the why

One of the most important requirement is missing: for security, $p$ must be large, in the thousands bits. That's a necessary (not sufficient) condition for the Discrete Logarithm Problem modulo $p$ to ...
fgrieu's user avatar
  • 141k

Only top scored, non community-wiki answers of a minimum length are eligible