383 reputation
111
bio website
location
age
visits member for 1 year, 9 months
seen Aug 23 at 5:49

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.
Nov
26
comment Speed up modular exponentation with fixed base and modulus
I meant dependence between x and calculation time.
Nov
26
comment Speed up modular exponentation with fixed base and modulus
Sorry, what is θ(x)?
Nov
26
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?
Nov
26
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.
Nov
26
revised Speed up modular exponentation with fixed base and modulus
added 148 characters in body
Nov
26
asked Speed up modular exponentation with fixed base and modulus
Nov
26
revised Timing attack on modular exponentiation
deleted 2 characters in body