Reputation
2,102
Top tag
Next privilege 3,500 Rep.
Protect questions
Badges
3 16
Impact
~45k people reached

  • 0 posts edited
  • 1 helpful flag
  • 64 votes cast
Apr
22
reviewed No Action Needed Protocols with deliberate errors
Apr
22
reviewed No Action Needed Super-simple encryption of short strings
Apr
22
reviewed Reviewed Verification of Pinocchio (verifiable computation)
Apr
22
comment Verification of Pinocchio (verifiable computation)
You should probably add a link to the paper and make it easier for readers to find this $y$ and the verification procedure in the paper.
Apr
20
reviewed Leave Closed Multiple AES/ECB encryptions of different data with same key all end with same pattern
Apr
20
reviewed Close why are both ipad and opad required for HMAC?
Apr
14
reviewed Close Randomness in generation of Virtual Machines from pre-built Image
Apr
14
reviewed Close algebraic attacks for mixed operations (mod 2 and mod 256)
Apr
3
reviewed Looks OK Required key size for an ideal cipher with a 32 bit block size
Apr
3
reviewed Leave Open Paper about this secure P2P idea?
Apr
3
reviewed Leave Open Required key size for an ideal cipher with a 32 bit block size
Mar
19
reviewed Leave Open Deciphering text encrypted with a changing cipher
Mar
18
comment Concatenation of two strong hashes may have striking weakness
If $H_0$ and $H_1$ are independent hashes, the intuitive result holds in ROM, I guess.
Mar
18
comment Concatenation of two strong hashes may have striking weakness
Preimage resistance is indeed much more difficult to define than most basic texts pretend. Many natural definitions are defective in that obviously insecure constructions are secure according to the definition (e.g. choose an element at random from the co-domain: the preimage-finder must find a preimage of that element). I think a plausible definition is: the adversary chooses a suitable plaintext distribution, you sample from the distribution and compute the hash value, finally the adversary recovers any preimage. Under this definition, concatenation is not preimage-resistance-preserving.
Mar
16
reviewed Close Implementing modular reductions (n*n)
Mar
16
reviewed Close How to check if a sequence is generated by a linear congruential generator?
Mar
13
reviewed Leave Open Of what use is my code for finding prime numbers of a certain size?
Mar
11
reviewed Approve How to compute accumulated values in bilinear map accumulators
Mar
11
reviewed No Action Needed Workaround to implementing Forward Secrecy
Mar
11
reviewed Leave Open Known plaintext, unknown 128 bit block cipher