1,262 reputation
417
bio website
location Saarbrücken, Germany
age 26
visits member for 2 years, 6 months
seen 2 days ago

Oct
16
reviewed Leave Closed Is this a secure multiparty protocol?
Oct
9
reviewed Leave Open Is there a developer's resource that ties encryption methods and strengths to the appropriate usage scenarios?
Oct
9
reviewed Close WIN LM Password Hashes (using John the ripper)
Oct
9
reviewed Leave Open Reordering non-block-aligned parts with DES in ECB mode
Sep
23
comment How to decode an OTP message?
The question states, that it's encoded as 8-bit ascii, so no it cannot be a=1...
Sep
22
comment Reusing keys with AES-CBC
"keys must not be reused in AES-CTR" This claim is wrong. Keys can be safely reused in CTR mode, as long as the probability that the counter ranges intersect is negligible.
Sep
21
comment Proof that IND$-CPA implies IND-CPA?
Your reduction and analysis seem to be correct as far as I can see. Maybe you should consider editing the question to include the relevant definitions and putting your proof in an answer. As it currently stands, "Yes your proof is correct" seems to be a valid answer, but that would not be very interesting.
Sep
10
comment General-purpose non-interactive multi-party computation protocol
You should change your question. Whatever it is you are asking about, it's not multi-party computation. In a multi-party computation protocol, multiple parties compute a function on secret inputs from each party. There is no dealer and usually no partial results.
Aug
14
answered Is there a way to encrypt multiple sets of data into one result, with separate keys decrypting each set of data
Aug
11
reviewed Leave Open Is this an acceptable authenticated encryption?
Aug
11
reviewed Leave Open Alice's forgetful banking
Aug
11
comment Verify Messages to Embedded Device
Why would you need a new keypair for each device? It seems more sensible to have only one keypair (i.e. the keypair of your server) and embed the public ky into the devices. As the devices neither need to generate keys, nor produce signatures, their RNG is not a problem.
Jul
25
comment Hash function based on pseudorandom functions and security
In fact, a hash function can never be a PRF, because it is publicly computable.
Jul
25
awarded  Custodian
Jul
25
comment Hash function based on pseudorandom functions and security
@Thomas No, standard notions for hash functions definitely do not imply that a hash function is a PRF.
Jul
25
reviewed Approve suggested edit on Hash function based on pseudorandom functions and security
Jul
15
answered Primality testing (deterministic vs. non-deterministic)
Jul
15
comment Primality testing (deterministic vs. non-deterministic)
Compared to probabilistic algorithms AKS is horribly inefficient.
Jul
8
comment Difference between actual attacks and theoretical attacks on SHA cryptographic series
Mainly because "attacks only get better" A theoretical attack means, that somebody has found a way to attack the system faster than expected. This often leads to a series of better and better attacks until we have something that can actually be used against the system in practice.
Jul
5
answered Lamport-Diffie + Security Proof