10,719 reputation
11046
bio website vyznev.net
location Helsinki, Finland
age
visits member for 2 years, 8 months
seen 14 hours ago

I'm not really a cryptographer, I just play one on the internet.

Seriously, I'm just a programmer and mathematician interested in puzzles and information security. I don't have any kind of formal crypto training, but I've picked up a few things here and there over the years. Topics I'm particularly interested in include protocol design and analysis, classical ciphers and information-theoretically secure crypto techniques such as one time pads and secret sharing schemes.

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.


Mar
23
comment Certificate signature with SHA-1 and RSA: where do 1888 bits come from?
See also identical question on security.SE.
Mar
23
reviewed Satisfactory One-time digital signatures
Mar
23
revised One-time digital signatures
edited tags
Mar
23
answered One-time digital signatures
Mar
23
reviewed Satisfactory Can passwords be stored securely so that a similarity comparison can be made?
Mar
23
reviewed Needs Improvement ASCII: weakness
Mar
23
reviewed Satisfactory Choice of reduction polynomial in Whirlpool's internal cipher
Mar
23
comment Choice of reduction polynomial in Whirlpool's internal cipher
Ps. See also this related question.
Mar
23
answered Choice of reduction polynomial in Whirlpool's internal cipher
Mar
23
reviewed Satisfactory simple multiplication in GF(8)
Mar
23
reviewed Satisfactory Signature based on public key cryptography and forgery
Mar
23
comment Is this approach to generating a “random” number from a sha512 hash effective?
The list of participants' names might not have enough entropy to prevent you from cheating even without help from others. In particular, if you can guess who might sign up for the raffle (and in what order), you could compile a bunch of likely participant lists in advance, and, after testing a large number of possible secret inputs against those lists, select the one that has the best chance of giving you a favorable outcome if the actual participant list happens to match one of your guesses.
Mar
23
reviewed Needs Improvement Is this approach to generating a “random” number from a sha512 hash effective?
Mar
21
answered SHA-224 Purpose
Mar
13
comment I need a 64-bit cryptographic hash for 96 bits of data
+1. The birthday bound is a harsh mistress.
Mar
13
revised Can a monoalphabetic substitution cipher attain perfect secrecy?
deleted 24 characters in body
Mar
13
answered Can a monoalphabetic substitution cipher attain perfect secrecy?
Mar
13
revised Can a monoalphabetic substitution cipher attain perfect secrecy?
latex formatting
Mar
7
answered Rfc2898DeriveBytes - password length
Mar
6
revised Authenticated encryption without padding
rolled back to a previous revision