meta user
network profile
| bio | website | vyznev.net |
|---|---|---|
| location | Helsinki, Finland | |
| age | ||
| visits | member for | 1 year, 9 months |
| seen | May 12 at 7:27 | |
| stats | profile views | 90 |
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.
|
Jan 29 |
answered | Cryptographic Symmetric Stream Cipher |
|
Jan 29 |
revised |
What is a smart card? retag, copyedit |
|
Jan 29 |
revised |
Using Chi-Square for Vigenere Cipher edited tags |
|
Jan 29 |
comment |
RSA and One Time Password (OTP) service And why should the server trust the results of whatever verification the client does (or claims to have done)? |
|
Jan 28 |
comment |
RSA and One Time Password (OTP) service What, exactly, are your requirements? In particular, what is that you're trying to achieve with this scheme? It looks like you're trying to authenticate something to something else, but who or what exactly are the parties involves and their roles in this authentication? |
|
Jan 24 |
answered | Cryptographic Primitive Method |
|
Jan 24 |
comment |
Cryptographic Primitive Method @Auth: Did you post that last comment on the wrong question? |
|
Jan 24 |
awarded | encryption |
|
Jan 23 |
awarded | Custodian |
|
Jan 23 |
reviewed | Close What does modular inversion mean? |
|
Jan 23 |
reviewed | Close Is a steganographic technique which has a universal decoder novel/secure? |
|
Jan 23 |
reviewed | Leave Open Many time pad attack |
|
Jan 23 |
answered | Many time pad attack |
|
Jan 23 |
awarded | Custodian |
|
Jan 23 |
comment |
How to generate a key using any m passwords out of total n? Possible duplicate of Can I pre-define the points in Shamir's Secret Sharing algorithm. (Your question is somewhat more general, since it doesn't mention Shamir's scheme explicitly, but the answers apply to the more general case as well.) |
|
Jan 23 |
comment |
Using CBC with a fixed IV and a random first plaintext block @Paŭlo and others: I made a few changes, but I'm sure it could be improved further yet. |
|
Jan 23 |
comment |
Does it take brute force to find a pair of plaintext and ciphertext that each follow a certain condition, given an AES encryption key? @Joe: Note that, if you fix 64 bits of the plaintext and 64 bits of the ciphertext of a 128-bit block cipher, then there's about a $e^{-1}\approx 0.37$ chance that no such pair will exist. (More generally, if you fix $j\gg0$ out of $n$ bits of the plaintext and $k\gg0$ out of $n$ bits of the ciphertext, then the probability of there being at least one matching pair is about $1-e^{-2^{n-j-k}}$.) |
|
Jan 23 |
revised |
Using CBC with a fixed IV and a random first plaintext block try to canonicalize this question after merge |
|
Jan 22 |
answered | Does it take brute force to find a pair of plaintext and ciphertext that each follow a certain condition, given an AES encryption key? |
|
Jan 21 |
revised |
CBC with fixed IV but changing data edited tags |
