10,604 reputation
11044
bio website vyznev.net
location Helsinki, Finland
age
visits member for 2 years, 8 months
seen yesterday

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.


Aug
15
wiki created forward-secrecy description
Aug
15
wiki created forward-secrecy excerpt
Aug
14
reviewed Reviewed Is there an algorithm or hardware that can sign/verify natural time?
Aug
14
reviewed Leave Open Do companies like CipherCloud really have the option to use homomorphic encryption?
Aug
14
revised How does one calculate the cryptoperiod?
edited tags
Aug
13
revised Why is the Pedersen commitment computationally binding?
use \bmod
Aug
13
reviewed Edit suggested edit on Public Keys on Social Media
Aug
13
revised Public Keys on Social Media
texify, add new tag
Aug
13
revised Fractal Merkle Traversal
edited tags
Aug
13
revised Is there an algorithm or hardware that can sign/verify natural time?
edited tags
Aug
13
revised
do not use for timestamping, we already have a tag for that
Aug
12
comment Pre-image resistant but not 2nd pre-image resistant?
@HenrickHellström: Usually, hash functions are assumed to be maps from $\{0,1\}^*$ to $\{0,1\}^n$ for some fixed $n$. No such map is a bijection. But yes, if we're allowed to narrow down the domain or expand the range of our hash function enough to make it bijective (or at least injective), it's easy to make even trivially weak hash functions 2nd preimage resistant. In particular, the identity function is clearly 2nd preimage and collision resistant, but finding first preimages is trivial.
Aug
11
reviewed Leave Open Timestamping services authorities, utilizing Linked, hybrid and other than PKI schemes
Aug
11
reviewed Leave Open Decrypting DES with decrypted and encrypted data
Aug
11
reviewed Approve suggested edit on How does certificate-based encryption solve key revocation problem?
Aug
11
reviewed Reviewed Verify Messages to Embedded Device
Aug
11
revised How does DES decryption work? Is it the same as encryption or the reverse?
copyedit, tags
Aug
9
reviewed Close Learning to encrypt/encryption algorithms
Aug
9
reviewed Close Jumblar: Using map locations as passwords
Aug
9
reviewed Leave Open Alice's forgetful banking