11,808 reputation
11149
bio website vyznev.net
location Helsinki, Finland
age
visits member for 3 years
seen Aug 30 at 14:00

I'm a PhD student in biomathematics, working on stochastic individual-based models of evolution in spatially structured populations. My other interests include cryptography, programming games and puzzles, photography and graphic design.

I started programming (in AmigaBASIC) when I was 10 years old. Nowadays, I'm most comfortable using Perl, C and JavaScript. I know Java and PHP too, but I can't really say I like them. I also know some Python, but not as much as I'd like.


CC-Zero 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.


I'm the main author and maintainer of the Stack Overflow Unofficial Patch (SOUP), a user script for browsers with GreaseMonkey-compatible user script support (Firefox, Chrome, Opera, possibly Safari) that fixes or works around a number of outstanding issues with the Stack Exchange user interface.

I tend to answer a lot more questions than I ask. Some answers I'm rather proud of:


Aug
30
revised hash-signature wiki description
rewrite; the previous tag wiki did not reflect the way the tag is used here
Aug
30
revised hash-signature wiki excerpt
rewrite; the previous tag wiki did not reflect the way the tag is used here
Aug
30
reviewed Reject suggested edit on encoding tag wiki excerpt
Aug
30
reviewed Reject suggested edit on order-preserving tag wiki
Aug
30
reviewed Approve suggested edit on ed25519 tag wiki excerpt
Aug
30
reviewed Reject suggested edit on order-preserving tag wiki excerpt
Aug
30
reviewed Approve suggested edit on ed25519 tag wiki
Aug
30
reviewed Reject suggested edit on Why is the complexity of RSA-1024 80 bit and not 86 bit?
Aug
30
comment Why is the complexity of RSA-1024 80 bit and not 86 bit?
@poncho: That's correct. What I was driving at was more that, if the $o(1)$ term (assuming it's not just a mistake) was significant for typical values of $n$, one would expect it to be included explicitly in the formula, or at least to be mentioned in the article.
Aug
30
revised Why is the complexity of RSA-1024 80 bit and not 86 bit?
fix spurious ">" in formula, add tags
Aug
30
answered Why is the complexity of RSA-1024 80 bit and not 86 bit?
Aug
29
reviewed Close Am I insecurely implementing AES in Python?
Aug
29
reviewed Leave Open The security of an encrypt-and-MAC
Aug
29
comment The security of an encrypt-and-MAC
This seems very similar to this recent question. The only real difference I can see is that the other question explicitly specifies that k1 = RC4(k2).
Aug
29
accepted Does impersonating an SRP server give you enough information for an off-line dictionary attack?
Aug
29
revised How to hash a list of multiple items?
better title; rm sha-1 tag, not really relevant
Aug
29
answered How to hash a list of multiple items?
Aug
29
comment The security of an encrypt-and-MAC
It's not necessarily that impractical: you can derive the unique encryption and MAC keys from a master key and some nonce (e.g. a message number) using a KDF. Sure, changing the key for each message is probably slightly slower than using the same key for all of them, but then, if you're using HMAC you're presumably not aiming to squeeze every last bit of performance from your hardware anyway. (If you are, consider using a universal hashing based MAC instead.)
Aug
27
awarded  Nice Answer
Aug
27
comment RC4 system pitfalls
Your description seems to be missing some possibly relevant details. For instance, what key is used for the HMAC? Is the HMAC output also encrypted, and if so, how? And how are the segment lengths transmitted?