12,438 reputation
11352
bio website vyznev.net
location Helsinki, Finland
age
visits member for 3 years, 4 months
seen 11 hours ago

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.

Vote for me in the Mathematics.SE 2014 moderator election!


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:

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.


Sep
25
reviewed Excellent Point addition equation in projective co ordinates
Sep
25
reviewed Satisfactory Elliptic Curve Cryptography
Sep
25
reviewed Satisfactory Secure MultiParty Computation with secret inputs for secret outputs
Sep
25
reviewed Excellent The REACT transform and Replayable CCA
Sep
25
reviewed Satisfactory Session-specific Symmetric Key Derivation Using SHA256
Sep
23
awarded  Enlightened
Sep
23
awarded  Nice Answer
Sep
14
comment Solution with high decryption cost and low encryption cost
You mean the comment you left on the question above? I don't see any obvious issues there; obviously with such a small keyspace, you'll want to use a large slowdown factor; say, at least around $s = 32$ (or more, if practical).
Sep
11
comment Isn't a simple Vernam cipher as secure as known symmetric key algorithms?
@Rox: See Kerckhoff's principle: a secure cryptosystem should remain secure even if the attacker knows exactly how it works (and, in particular, how you produced your key). Besides, if someone trying to crack your cipher didn't already know that you used a standard PRNG, now they do, because you posted about it here. Mind you, even if they didn't know, they might guess it anyway, since it's such a common amateur mistake.
Sep
9
revised Isn't a simple Vernam cipher as secure as known symmetric key algorithms?
added 64 characters in body
Sep
9
revised Isn't a simple Vernam cipher as secure as known symmetric key algorithms?
edited body; edited title
Sep
9
answered Isn't a simple Vernam cipher as secure as known symmetric key algorithms?
Sep
3
answered Statistical tests for pseudorandom permutations
Aug
29
reviewed Leave Open RSA was rejected by which journal?
Aug
29
reviewed Leave Open Solution with high decryption cost and low encryption cost
Aug
28
answered Solution with high decryption cost and low encryption cost
Aug
28
comment Solution with high decryption cost and low encryption cost
Alas, this does not meet the 100,000+ messages/sec encryption requirement, at least not if the messages have different keys.
Aug
28
revised How would you encrypt-then-MAC when using pen-and-paper and a Caesar cipher?
edited tags
Aug
28
comment Good challenges for a crypto competition for teenagers
Sure you can do visual crypto without a computer. Just get some semitransparent graph paper and color in the squares. The resolution won't be too great, but you should be able to make some recognizable images.
Aug
28
revised Good challenges for a crypto competition for teenagers
nicer link syntax