Why are some group representations much easier to compute discrete logarithm for?
43477
Choosing between additive or multiplicative group for Diffie-Hellman
99815
Dividing versus multiplying by inverse in modular arithmetic
110559
Why is the minimum size of a generating set for a finite group at most $\log_2 n$?
115247
Real world use cases of bitwise operators
15951
Most efficient implementation of a large number class
130706
Group presentations and the Dihedral Group
15110
About irrational logarithms
43226
Intuition behind logarithm inequality: $1 - \frac1x \leq \log x \leq x-1$
94703
Time complexity and optimality
56528
On the proof of existence and uniqueness of radix representation
63253
Computing easy direct limit of groups
146299
Can reduced-round ChaCha be used as non-cryptographic fast PRNG to produce output indistinguishable from random data?
83146
Is there an approximation to the natural log function at large values?
141010
Computing $n$-th external power of standard simplectic form
154948
Decisional Diffie-Hellman: compute Legendre symbol of $g^{ab}$ from $g^a$ and $g^b$?
40286
What's so "natural" about the base of natural logarithms?
23128
Why aren't logarithms defined for negative $x$?