35,045 reputation
12974
bio website
location
age
visits member for 3 years, 7 months
seen 10 hours ago

Mar
17
reviewed Close I was wondering if RSA is an homomorphic crypto system?
Mar
17
reviewed Leave Open Weaknesses of truncated hash value
Mar
16
reviewed No Action Needed Differential Fault Analysis of AES
Mar
16
comment CCA-attack is possible in RSA, but how the decryption key $d$ is known to anyone
@Aria: same thing -- they do not reveal the keys; they might reveal the text of an encrypted message.
Mar
16
answered CCA-attack is possible in RSA, but how the decryption key $d$ is known to anyone
Mar
16
reviewed Leave Closed Block size of 128 bit in (quantum) future
Mar
16
reviewed Close How to check if a sequence is generated by a linear congruential generator?
Mar
15
comment Implementing modular reductions (n*n)
Are you attempting to implement Paillier? I assume that you need to implement (say) a 2048 bit $n$, and the chip is unable to perform modular reductions on 4096 bit numbers, correct?
Mar
15
comment Encryption with a known plaintext
You beat me to the punch; a Message Authentication Code (or MAC) is what you're looking for. An HMAC is a good choice (assuming you use a reasonable hash function) -- if you prefer to use a block cipher, CMAC is another fine choice.
Mar
15
reviewed No Action Needed Encryption with a known plaintext
Mar
14
reviewed Close Implementing modular reductions (n*n)
Mar
14
reviewed Close How do you break encryption on a message?
Mar
14
reviewed Close Is there any task better and less complex than oblivious transfer?
Mar
13
comment If the text was compressed before using traditional cryptography, how much difficulty increases for frequency analysis attack?
Classical cryptography doesn't use bit strings, instead they use strings from some alphabet (perhaps with 26 characters, maybe more, maybe less). Are you assuming that we modify the compression to work with this alphabet?
Mar
13
reviewed No Action Needed If the text was compressed before using traditional cryptography, how much difficulty increases for frequency analysis attack?
Mar
13
reviewed Approve Of what use is my code for finding prime numbers of a certain size?
Mar
13
reviewed Approve diffusion tag wiki excerpt
Mar
13
comment Why is this a fix to Bleichenbacher's attack?
@Mark: correct; the attacker was using the server as such an Oracle; this change in behavior prevents that.
Mar
13
reviewed No Action Needed Implementing modular reductions (n*n)
Mar
13
reviewed No Action Needed Attack on key exchange with authentication