Reputation
1,633
Top tag
Next privilege 2,000 Rep.
Access moderator tools
Badges
6 19
Newest
 Enlightened
Impact
~37k people reached

May
22
reviewed Edit Authenticated EC key exchange without a signing/signature scheme?
May
22
revised Authenticated EC key exchange without a signing/signature scheme?
grammar and spelling
May
21
comment Is it possible to have identical public keys for different ciphers?
No, the answer is off-topic and does not adress the question in any way. The question is whether it is possible to have two unrelated public key encryption schemes that are able to use the same public key. The question has nothing to do with collisions in the key-generation algorithm.
May
21
comment Is it possible to have identical public keys for different ciphers?
This does not attempt to answer the question.
May
17
comment Which of the following hash functions is collision resistant?
All I'm saying is that collision resistance does not follow in general. There can of course be instances of $H$ where $H'$ is collision resistant. It just doesn't follow in general. I.e., the collision resistance of SHA-224 does not follow from the assumption that SHA-256 is collision resistant. However we assume a lot more about SHA-256 than just collision resistance.
May
17
comment Which of the following hash functions is collision resistant?
7 is not collision resistant. Even removing a single bit can cause your function to become non-collision resistant. As an example, let $G$ be a collision resistant hash-function. Then $H(m\Vert b) = G(m)\Vert b$ is also collision resistant, however cutting away the last bit gives a trivial attack. (any pair of messages that differ only in the last bit collide)
May
16
answered CCA secure or not?
Feb
20
answered Implications of reversing CBC encryption
Feb
18
answered How to show that a function is not a PRP?
Feb
17
reviewed Approve What prime lengths are used for RSA?
Feb
15
reviewed Approve Is there a security analysis of CryptDB?
Feb
14
comment How much computing resource is required to brute-force RSA?
@dave_thompson_085 "Slightly" by two orders of magnitude. :D Fixed it. (though it's 5.95495, so 5.95)
Feb
14
revised How much computing resource is required to brute-force RSA?
edited body
Feb
9
comment Hash function as secure as one-time pad?
This does not seem to attempt to answer the question.
Feb
8
comment Is $f(x)\oplus x$ a one-way function?
If one-way functions do not exist, then the statement is trivially true, because it is an all quantified statement about the empty set.
Feb
8
comment Is $f(x)\oplus x$ a one-way function?
Thanks, fixed the $x_1$ mixup. About the generality, yes that is true, as long as the length of $x_1$ is superlogarithmic, everything should be fine. But as this is a counter example, I think it's fine to be more specific.
Feb
8
revised Is $f(x)\oplus x$ a one-way function?
added 1 character in body
Feb
8
answered Is $f(x)\oplus x$ a one-way function?
Feb
2
answered Definition of ciphertext security
Feb
2
comment Definition of ciphertext security
Where does it state in the screenshot that such a scheme is secure?