10,604 reputation
11044
bio website vyznev.net
location Helsinki, Finland
age
visits member for 2 years, 8 months
seen yesterday

I'm not really a cryptographer, I just play one on the internet.

Seriously, I'm just a programmer and mathematician interested in puzzles and information security. I don't have any kind of formal crypto training, but I've picked up a few things here and there over the years. Topics I'm particularly interested in include protocol design and analysis, classical ciphers and information-theoretically secure crypto techniques such as one time pads and secret sharing schemes.

Please consider any (original) code I post to Stack Overflow (and other Stack Exchange sites) to be released under CC-Zero unless stated otherwise. You may do whatever you want with it and don't have to credit me in any way, although of course that would be nice.


Jan
30
revised Is the Couvreur et al. polynomial time attack on McEliece practical?
copyedit
Jan
30
reviewed Leave Open Efficient Robust Private Set Intersection Questions
Jan
30
answered Efficient Robust Private Set Intersection Questions
Jan
30
reviewed Leave Open Efficiently computing the neutral element in a ring isomorphic to Z/NZ?
Jan
30
awarded  Custodian
Jan
30
reviewed Close ElGamal Homomorphic Encryption Formula Question
Jan
29
comment Avoiding overflow when encrypting with RSA
Also, just to clarify your last sentence above, the "flaws" for small $e$ (like Coppersmith's attack) only appear if one does not use a secure padding scheme (e.g. OAEP). With proper padding, RSA is secure even for $e=3$; without proper padding, it may not be secure for any $e$.
Jan
29
comment Efficient Robust Private Set Intersection Additive ElGamal
I just approved this edit suggestion from an anonymous user. (It still needs someone else to approve it.) I assume that was you? You might want to register an account here, so that you'll be able to edit your posts more easily.
Jan
29
reviewed Approve suggested edit on Efficient Robust Private Set Intersection Additive ElGamal
Jan
26
reviewed Close Question about SHA-2 (and potentially similar hashing algorithms)
Jan
24
revised Shamir Secret Sharing Modular Reduction
edited tags
Jan
14
comment Many time pad attack
@e-sushi: How does one attack a two-time pad (i.e. one time pad with key reuse)? would be a closer match; it even appears to be about the same Coursera exercise. This one's a little bit more specific, though, since the other question is about general solution methods while this one is specifically about the hint. (Also, the other question is kind of messy.) I wouldn't necessarily object to having them merged, but only if the questions are also edited to combine them.
Jan
14
revised Many time pad attack
attribute quote, copyedit
Jan
13
awarded  Convention
Jan
12
comment Binary simmilarity function
This isn't really a cryptography question, even if it's kind of close. Stack Overflow does allow algorithm design questions, so you could ask this there. Alternatively, Computer Science (as opposed to Computational Science) Stack Exchange could be another option.
Jan
12
revised Difference between CBC-MAC and CMAC
rewrite for clarity and to comply with policy (e.g. omit thanks)
Jan
12
comment Difference between CBC-MAC and CMAC
@figlesquidge: While the information requested probably is obtainable from Wikipedia, it's not very clearly presented there. IMO, this is a perfectly good reference question, and I'm hoping to see a concise and comprehensive answer summarizing the main differences.
Jan
11
reviewed Approve suggested edit on private-set-intersection tag wiki excerpt
Jan
11
answered If G is a secure PRG and G' is a function of G, is G' secure?
Jan
9
awarded  Nice Answer