13,720 reputation
11458
bio website vyznev.net
location Helsinki, Finland
age
visits member for 3 years, 7 months
seen 23 hours ago

I'm not really a cryptographer, I just play one on the Internet. ;-)

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'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
18
revised Can one implement AES on 4-bit microcontroller?
edited tags
Sep
18
revised Smart Card Basics
edited tags
Sep
18
revised Signature schemes for underpowered devices (8bit microcontroller)
edited tags
Sep
18
revised HASH Algorithm for 8 bits MCU
edited tags
Sep
18
wiki created lightweight description
Sep
18
wiki created lightweight excerpt
Sep
18
revised Which encryption method supports random reads?
added 448 characters in body
Sep
18
revised Which encryption method supports random reads?
edited tags
Sep
18
answered Which encryption method supports random reads?
Sep
18
reviewed Approve How to choose keys for a block cipher?
Sep
18
reviewed Approve Encrypting 8 times with 8-bit key beneficial?
Sep
18
reviewed Approve linear-cryptanalysis tag wiki
Sep
18
reviewed Approve modular-arithmetic tag wiki
Sep
18
reviewed Approve linear-cryptanalysis tag wiki excerpt
Sep
18
reviewed Approve modular-arithmetic tag wiki excerpt
Sep
18
comment Fast post-processing for broken RDRAND
The point of the Becker et al. attack is that they reduce the state space of the RNG to (e.g.) 32 bits (plus a 224-bit constant known only to the attacker). Testing each of $2^{32}$ possible states is generally not much of a challenge to an attacker with even a single modern CPU.
Sep
17
awarded  Electorate
Sep
17
revised How is the key shared in symmetric key cryptography?
copyedit, add tags
Sep
17
revised Fast post-processing for broken RDRAND
added 629 characters in body
Sep
17
answered Fast post-processing for broken RDRAND