Reputation
20,864
Next tag badge:
71/100 score
19/20 answers
Badges
2 34 89
Impact
~572k people reached

May
15
answered How do we guarantee plaintext is coprime in RSA?
May
14
comment Why cant Public Key Encryption be perfectly secure?
What makes you think they can't? Just because we don't know of one that does, does not mean that one does not exist. I am not aware of any proof stating that a public key cipher cannot provide perfect secrecy. Are you?
May
13
comment Outsourced Multiparty computation proof in Ideal world
The start of section 4 of the paper you linked to has a pretty good explanation.
May
13
comment Outsourced Multiparty computation proof in Ideal world
you need to design the simulator in order to prove security. See this answer
May
12
comment Is HMAC-MD5 still secure for commitment or other common uses?
I updated the answer I referenced that had $hmac(m,k)$ to be $hmac(k,m)$
May
12
revised Game with symmetric key
edited body
May
12
awarded  Guru
May
12
comment Is HMAC-MD5 still secure for commitment or other common uses?
@MaartenBodewes, hopefully only to the trained eye.
May
12
comment Role of trusted party in the Ideal model in Malicious case
What is your end goal? To prove security? If so, what is the high level strategy for this? Typically it is to show indistinguishability between the real world and the ideal world. Is that what you want to do?
May
11
asked Is HMAC-MD5 still secure for commitment or other common uses?
May
11
revised Is HMAC-MD5 considered secure for authenticating encrypted data?
edited title
May
11
comment Is HMAC-SHA-1 secure?
You should update your answer. An attack on HMAC-MD5 has been found.
May
10
comment XOR = Best encryption?
I think there are some conditionals that need to be added here. Not all keys will get the security you describe.
May
8
answered Does the Paillier system remain secure if it is used to encrypt only binary values, i.e. {0, 1}?
May
7
comment Algorithm for n-of-m keys with partial results
@viraptor to encrypt with a stream cipher, you use XOR. XOR is commutative and you can do it many times. So for message $m$ you can do $c=m\oplus k_1\oplus k_2$. To decrypt, do $c\oplus k_1 \oplus k_2$ or even $c\oplus k_2\oplus k_1$.
May
7
answered Algorithm for n-of-m keys with partial results
May
7
revised Algorithm for n-of-m keys with partial results
added 34 characters in body
May
7
comment Algorithm for n-of-m keys with partial results
Who should get the output of the encryption/decryption operation?
May
7
comment Algorithm for n-of-m keys with partial results
what kind of en/decryption are you thinking? Symmetric or Asymmetric?
May
6
comment Given an encrypted file, what are possible ways to find its encryption algorithm?
Is it safe to assume you are only interested in modern ciphers? Also, do you want to place a limit on the size of the encrypted file? With unlimited data, there may be some things you can do. Also, by "encryption algorithm" do you mean "AES vs Serpent vs 3DES", that sort of comparison, or are you interested in modes of operation too?