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.


13h
reviewed Reviewed Signature verification with only hash (without full data)
13h
reviewed Close vector space retrieval model
14h
comment What is the fixed point attribute of DES (when used with weak-keys)
@mikeazo: The DES weak keys have been discussed in this question, but I think what Bush is asking about the existence of fixed points for those weak keys, as discussed e.g. here and here.
1d
reviewed Delete Probability of factoring keys as a function of bit length
Dec
15
answered What is the difference between uniformly and at random in crypto definitions?
Nov
17
comment Consequences of AES without any one of its operations
@poncho: That looks like an answer to me. Want to make it one?
Nov
16
comment CCA security of a system that splits messages and encrypts each packet
Is this homework? It appears to be phrased as such. If so, let me just give a hint: en.wikipedia.org/wiki/Malleability_%28cryptography%29
Nov
16
comment Why sorting is needed for Meet-in-the-middle attack
Small note: In practice, you probably wouldn't use a binary search, but rather you'd sort both sets and run a list merge on them. In any case, though, you still end up doing about $O(n \log n)$ comparisons; without sorting, that would be $O(n^2)$, which is no more efficient than brute force.
Nov
13
answered Perfectly secret cipher can leak about the key?
Nov
12
comment IPsec authentication and encryption lgorithms
As the Wikipedia page notes, actual IPsec implementations typically seem to be on the kernel level (for example, the Linux kernel includes one since v2.5), and so won't generally be portable per se. The underlying crypto algorithms, however, are, and can be found e.g. in the OpenSSL library, which should meet your specs (cross-platform support, written in C). Of course, OpenSSL is really a TLS/SSL library, so it contains a lot of other stuff besides the crypto primitives, too, but as long as you don't mind the extra cruft (which is all in a shared library, anyway), it might be a good choice.
Nov
11
reviewed Close what is SALSA20 Nonce and its requirements
Nov
11
reviewed Close Pros and cons between HOTP and TOTP
Nov
11
reviewed Reviewed IPsec authentication and encryption lgorithms
Nov
11
answered IPsec authentication and encryption lgorithms
Nov
11
reviewed Reviewed Can hashing become encrypting?
Nov
11
reviewed Reviewed openssl - Recommended way to encrypt and sign S/MIME messages using openssl
Nov
11
reviewed Reviewed ASCII input to HMAC weaker than raw bytes?
Nov
11
reviewed Reviewed what are the security benefits of LUKS?
Nov
11
awarded  Nice Answer
Oct
31
awarded  Notable Question