2,735 reputation
316
bio website
location
age
visits member for 2 years, 2 months
seen Dec 18 at 22:17

Dec
9
reviewed Close Stream cipher with Diffie-Hellman and Cryptographic Hash Function?
Dec
9
reviewed Close Fermats Little Theorem, primitive root
Dec
9
reviewed Close practical use of homomorphic encryption
Dec
9
reviewed Close Are ePassports still vulnerable?
Dec
9
reviewed Close Asymmetric encryptions' computational complexity
Dec
9
reviewed Leave Open Is there (this) a case in which salting is dispensable?
Dec
2
comment practical use of homomorphic encryption
FHE currently is like using a skateboard, if you're used to drive a car. It is used for fun (well, research), but if you need to travel actually, don't use the skateboard.
Nov
27
reviewed Close What is the difference between IND-CCA2 and NM-CCA2? And how does one imply another?
Nov
27
comment What is the difference between IND-CCA2 and NM-CCA2? And how does one imply another?
What research have you done? Do you understand the difference between security notions? In its current state, the question lacks effort and information.
Nov
27
reviewed Close Meaning of Multiplicative Group to the power n i.e. Z^n
Nov
27
reviewed Close Is the Vigenère Cryptosystem malleable?
Nov
27
reviewed Close Modern integer factorization software
Nov
27
reviewed Leave Open What is the difference between order of base point and curve order in EC?
Nov
27
reviewed Close can you suggest any applicayion for implementing threshold homomorphic encryption cryptosystem(Paillier cryptosystem)
Nov
27
revised Minimum number of independent trials needed to detect a bias
Changed tag
Nov
27
comment Elliptical curve cryptography key generation time
Concerning the naive approach: If you could do it that way, then brute forcing the key in the same manner would also be possible. Double-and-add is your only choice. (and its optimizations, especially NAF and wNAF are worth looking at)
Nov
25
comment When would one prefer a proof of knowledge instead of a zero-knowledge proof?
Proofs of knowledge are used for example to prove the knowledge of a trapdoor. If you consider discrete logarithms for an element $y$ to some base $x$, you want to prove that you know $\log_x y$. But obviously, you would also want your proof to be zero-knowledge in this case, or you could just state the solution and say "This is it, this is proof that I knew the solution".
Nov
24
comment DHE key exchange. Is it really secure?
Humans are so bad at understanding exponential growth... Best example is the question "How often can you fold a paper, and guess how thick it will be" -> typical are 6 or 7, record is at 12 atm
Oct
22
comment How Secure is a Pronounceable Password? In means of entropy
What is enough entropy for your use? How long is that pronounceable password? Entropy for passwords from language are hard to measure, because you would have to know the likelihood of each syllable, etc. Then: Do you consider saying "hash", "dot" pronounceable? Most symbols have some form to speak them out.
Oct
20
comment Database row level encryption scheme
I don't think it is a scare tactic, it is a rule of thumb for people without the necessary background and experience. What you wrote is exactly what I meant: Memory management and the other aspects you mentioned are those pitfalls, which "amateurs" overlook and thus create software with massive holes in it. Simply coding the algorithm description of AES or RSA from a textbook is not enough. And usually, cryptographers also fall in this category: Quite often the people who design a new cryptographic primitive are not the ones implementing it.