12,133 reputation
11251
bio website vyznev.net
location Helsinki, Finland
age
visits member for 3 years, 2 months
seen yesterday

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:


Oct
10
comment Why is TLS SRP verifier based on user name?
@nefarel: Dunno. I might mutter something about Merkle-Damgård length extension attacks, or about provable reducibility to the PRF-ness of the SHA1 compression function, but honestly I have no real idea. It looks sort of like a clumsy imitation of HMAC, but since the folks who designed SRP are pretty smart cryptographers, presumably it's a clever imitation of HMAC, I just don't know exactly how or why. That might make an interesting question in itself.
Oct
4
revised How is XOR used for encryption?
added 465 characters in body
Oct
4
answered How is XOR used for encryption?
Sep
30
awarded  Explainer
Sep
26
reviewed Close Base64 for a hash algorithm
Sep
26
reviewed Leave Open Question about the security of Substitution-Permutation Network
Sep
25
reviewed Leave Open Why are we advising PKI if we know that quantum computers will break them?
Sep
25
comment Why are we advising PKI if we know that quantum computers will break them?
Practical quantum computing, like practical fusion power, has been "10-20 years in the future" for several decades already. Basically, in both cases, we thought we knew the theory, and that the rest would be just a simple matter of engineering. Alas, sometimes "mere engineering" turns out to be not so easy, after all.
Sep
25
reviewed Leave Open stream cipher computation cost
Sep
25
revised stream cipher computation cost
added 1026 characters in body
Sep
25
answered stream cipher computation cost
Sep
25
reviewed Leave Open Using modulus in one time pad?
Sep
25
reviewed Satisfactory Is SRP post-quantum secure?
Sep
25
reviewed Satisfactory Combining two keys
Sep
25
reviewed Satisfactory Can you fake messages from recorded message-history?
Sep
25
reviewed Satisfactory ECDSA with SHA256 and sepc192r1 curve: Impossible, or how to calculate $e$?
Sep
25
reviewed Satisfactory MAC using a modified CBC mode of operation
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