Smit Johnth
Reputation
441
Top tag
Next privilege 500 Rep.
Access review queues
 Dec 7 awarded Popular Question Aug 31 awarded Yearling Jul 9 awarded Notable Question May 24 awarded Popular Question Mar 27 awarded Popular Question Feb 28 awarded Popular Question Jan 23 awarded Popular Question Aug 22 awarded Popular Question Jul 2 awarded Curious Apr 30 comment Timing attack on modular exponentiation Still no answer on how to exploit the knowledge of 1-bits in exponent. Apr 30 suggested rejected edit on Solving a discrete logarithm using GDlog Apr 30 comment Solving a discrete logarithm using GDlog How to get 362274084216648467976382636880 from 142363323 then? Feb 24 awarded Yearling Nov 28 revised Speed up modular exponentation with fixed base and modulus edited body; edited title Nov 28 revised What operations are used in symmetric cryptography and why? returned similar questions Nov 27 comment Speed up modular exponentation with fixed base and modulus I meant speedup compared to the table for $a^{2^n}$ Nov 27 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? Nov 27 revised What operations are used in symmetric cryptography and why? added 199 characters in body Nov 26 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? Nov 26 comment Speed up modular exponentation with fixed base and modulus Ah ok. But normally it's $1,5 log2(x)$. NOt a big gain.