Smit Johnth
Reputation
441
Top tag
Next privilege 500 Rep.
Access review queues
3 16
Impact
~19k people reached

 Apr 30 comment Timing attack on modular exponentiation Still no answer on how to exploit the knowledge of 1-bits in exponent. Apr 30 comment Solving a discrete logarithm using GDlog How to get 362274084216648467976382636880 from 142363323 then? 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 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 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. Jun 22 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? Jun 20 comment Is triple des similiar to RSA in that they message size is limited to the key size? @poncho And would you explain why? Jun 10 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 Jun 6 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. Jun 4 comment Which version(s) of SRP are in ISO/IEC 11770-4:2006? If you consider you local network secure, you can use plain text :) Jun 4 comment Which version(s) of SRP are in ISO/IEC 11770-4:2006? There is already TSL-SRP, what's the difference between it and ISO? Jun 4 comment Which version(s) of SRP are in ISO/IEC 11770-4:2006? Since SE is already impersonal and community-oriented, could you explain, why is ISO/IEC 11770-4:2006 so interesting? May 31 comment Reversing SHA1 (don't know the correct term) Well, I overlooked this addition. Seems SHA-1 is resistant against this type of attack, but is it really so? May 31 comment How to test if a number is a primitive root? The person who gave another answer deleted it and probably removed his upvote and unstarred the question :) Or was it someone else?