Smit Johnth
Reputation
388
Top tag
Next privilege 500 Rep.
 Apr30 comment Timing attack on modular exponentiation Still no answer on how to exploit the knowledge of 1-bits in exponent. Apr30 comment Solving a discrete logarithm using GDlog How to get 362274084216648467976382636880 from 142363323 then? 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? 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. Nov26 comment Timing attack on modular exponentiation I would like to see an answer how the knowledge of 1 bits would speed up breaking the modular exponentation. Nov26 comment What operations are used in symmetric cryptography and why? @Reid dude, I know what they do. I asked what's the difference for using them in cryptographic algorithms. Why is + mod 32 used in MDx? Jul14 comment What operations are used in symmetric cryptography and why? Reid, so can you try to explain the choise of operations in protocols you mentioned? Jul14 comment What operations are used in symmetric cryptography and why? @Thomas ok, + doesn't invert itself, but it can be inverted with -. So what's the difference? Jul14 comment What operations are used in symmetric cryptography and why? Let's focus on symmetric crypto. Jul14 comment What operations are used in symmetric cryptography and why? Both xor and addition with overflow are involutions, what's the difference? Jun22 comment Is triple des similiar to RSA in that they message size is limited to the key size? @poncho lol block cipher must not be symmetric, should it? Jun20 comment Is triple des similiar to RSA in that they message size is limited to the key size? @poncho And would you explain why? Jun10 comment Is triple des similiar to RSA in that they message size is limited to the key size? Triple DES and RSA [b]are [/b] block ciphers. en.wikipedia.org/wiki/Triple_DES Jun6 comment Is triple des similiar to RSA in that they message size is limited to the key size? One AES opeation can encrypt only one block, for every thing else you need modes of operations.