Smit Johnth
Reputation
388
Top tag
Next privilege 500 Rep.
Cast close and reopen votes
 Mar27 awarded Popular Question Feb28 awarded Popular Question Jan23 awarded Popular Question Aug22 awarded Popular Question Jul2 awarded Curious Apr30 comment Timing attack on modular exponentiation Still no answer on how to exploit the knowledge of 1-bits in exponent. Apr30 suggested rejected edit on Solving a discrete logarithm using GDlog Apr30 comment Solving a discrete logarithm using GDlog How to get 362274084216648467976382636880 from 142363323 then? Feb24 awarded Yearling Nov28 revised Speed up modular exponentation with fixed base and modulus edited body; edited title Nov28 revised What operations are used in symmetric cryptography and why? returned similar questions Nov27 comment Speed up modular exponentation with fixed base and modulus I meant speedup compared to the table for $a^{2^n}$ Nov27 comment Speed up modular exponentation with fixed base and modulus The simpliest lookup method (table for every $2^n$) give 3x speedup, compared to this, every $x$ speed gain results in $2^x$ table growth (e.g. 8x speed gain needs 256 times bigger table), right? Nov27 revised What operations are used in symmetric cryptography and why? added 199 characters in body Nov26 comment Speed up modular exponentation with fixed base and modulus Originally there was a discussion if SRP needs slow hash function for password hashing or is modexp slow enough. x6 is probably not big enough to say modexp on modulus with safe length (at least 1kbit) doesn't slow down enough. Can it be made faster? Nov26 comment Speed up modular exponentation with fixed base and modulus Ah ok. But normally it's $1,5 log2(x)$. NOt a big gain. Nov26 comment Speed up modular exponentation with fixed base and modulus I meant dependence between x and calculation time. Nov26 comment Speed up modular exponentation with fixed base and modulus Sorry, what is θ(x)? Nov26 comment Speed up modular exponentation with fixed base and modulus AFAIU it's not $1/2 log_2 N$ but $\mathrm{pop}(x)$ where $\mathrm{pop}(x)$ is the number of $1$ bits (Hamming weight). Am I right? Nov26 comment Speed up modular exponentation with fixed base and modulus I want to know this "How big is the gain and what resources are needed?" The explanation in the blog is too big for fast understanding.