Reputation
21,932
Next tag badge:
71/100 score
19/20 answers
Badges
3 37 91
Newest
 Good Answer
Impact
~636k people reached

May
1
awarded  Good Answer
Apr
29
comment To what extent is WhatsApp's statement on secure messaging realistic?
Which begs the question, how do they verify it has all the other properties?
Apr
27
comment mode of operation in cryptography
@priyanka, not really. For CBC, if the message is not a multiple of the block size, you can pad. Sure that adds extra bytes, but who cares these days about a couple of extra bytes. I guess if you completely ignore security and define "best" as the most compact, you could argue that a streaming mode would be "best". Ignoring security, however, is not a good idea :)
Apr
27
reviewed Approve mode of operation in cryptography
Apr
27
answered mode of operation in cryptography
Apr
27
comment Question about Cipher Block Chaining(CBC)
Are the 2 bits side by side? Can they cross a block boundary? Can the bits have the same value (in which case there would be effectively no change), or are you guaranteed that the two bits that are interchanged have different values (one is a 0, the other is a 1)? Overall, however, you are not correct. Swapping 2 bits would not make all bits of the plaintext incorrect.
Apr
26
revised How to prove that twice the application of a secure PRF stays secure?
added 141 characters in body
Apr
26
reviewed Approve How to prove that twice the application of a secure PRF stays secure?
Apr
25
comment Why only one secret value with Shamir's secret sharing?
@poncho, definitely. So it is good to have a link to the question.
Apr
25
comment Why only one secret value with Shamir's secret sharing?
@poncho, I'm not sure this is a duplicate. That other question seems to be asking about sharing a single secret but using other coefficients instead of the $x^0$ term of the polynomial. This one is asking about using sharing multiple secrets at once.
Apr
25
comment Searchable Encryption with Substring Search
Let me make sure I understand, you want to be able to encrypt a string, send it to some untrusted 3rd party. That 3rd party should be able to find patterns in the encrypted strings without the decryption key? Are these patterns supplied by the user?
Apr
25
comment Why only one secret value with Shamir's secret sharing?
Finite fields as opposed to what? Shamir's scheme is defined over a finite field.
Apr
25
comment Why only one secret value with Shamir's secret sharing?
What you are looking for is multi-secret sharing. It has been a while since I've read up on it, but there are plenty of papers out there on the topic.
Apr
19
comment How to crack unknown 8-bit encryption algorithm?
@fgrieu, since you don't know the algorithm, you have to assume you can generate (e.g., via an oracle) enough input/output pairs to build that dictionary.
Apr
18
comment Which are similar encryption techniques as honey encryption?
What do you mean by "similar"? What capabilities/features are you specifically looking for?
Apr
18
answered How do voters verify a Helios (v3) election result?
Apr
18
revised Meaning of “random n/2 bit prime length prime p”
deleted 45 characters in body
Apr
18
revised Can you have partial cryptographic obfuscation (without a trusted setup)?
added 1 character in body
Apr
18
comment If one has hash = hash(salt + password) and one knows N pair of hash and salt is it easier to attack the password?
This is a very basic question. For questions like these, we require that you give an indication of what you have tried in attempting to solve the question on your own and what specifically is giving you problems. As it stands, your question looks like a dump of a homework problem, and there are very few here who will deprive you of a learning opportunity.
Apr
18
awarded  Nice Answer