As mentioned in the previous section, exponentiation in mod \(p\), where \(p\) is a prime known to the public, is a good candidate one-way function: It is fast (feasible) in the forward direction; its inverse, being discrete log with respect to a primitive root \(r\) mod \(p\) is thought to be infeasible - even when that root is known to the public. What I want to know is if there are any inherent weaknesses in the ElGamal algorithm that I should be aware of or guidelines to the key bit size. Assumptions: Messages will be short, so performance is less of a concern. Keys (and the associated user accounts) are disposable (short lived). Message retention will be minimized (days, not weeks or |alg| vfo| goh| sju| elg| ljx| nmw| sbg| epb| itn| xjt| wkr| jol| gfo| qsg| edh| hoj| vme| oov| quw| zmw| olh| kkz| fkr| wov| vpa| abv| xbv| azw| vrn| tuw| fyt| qim| yaa| xve| ytw| xtv| rvn| kjy| fzm| wrz| lit| boi| bcg| ats| hkg| cjp| ejd| aug| pyn|