meta user
network profile
| bio | website | vyznev.net |
|---|---|---|
| location | Helsinki, Finland | |
| age | ||
| visits | member for | 1 year, 10 months |
| seen | Jun 14 at 14:08 | |
| stats | profile views | 91 |
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.
|
Dec 15 |
comment |
RSA: If n=35, show that e will equal d $\gcd(3,24) \ne 1$. |
|
Dec 13 |
comment |
Proof of security for RSA signatures Ps. This is exercise 12.2 from Introduction to modern cryptography (hopefully now with a link that actually shows the page). |
|
Dec 13 |
revised |
Proof of security for RSA signatures improve formatting |
|
Dec 13 |
revised |
Proof of security for RSA signatures added 126 characters in body |
|
Dec 13 |
suggested | suggested edit on Proof of security for RSA signatures |
|
Dec 13 |
answered | Proof of security for RSA signatures |
|
Dec 3 |
answered | How to generate a list of unique random strings? |
|
Nov 28 |
revised |
How much would it cost in U.S. dollars to brute force a 256 bit key in a year? improve typography |
|
Nov 28 |
suggested | suggested edit on How much would it cost in U.S. dollars to brute force a 256 bit key in a year? |
|
Nov 24 |
comment |
Is a book cipher provably secure? +1 for the 130 million figure. That's not really all that much; we're talking about the equivalent of a 27-bit keyspace. |
|
Nov 24 |
comment |
Desirable S-box properties @Polynomial: There are many more linear and affine functions than just rotations. Basically, R2 says (assuming the mean linear/affine over $\{0,1\}$) that no S-box may be writable as $S(x) = a_0 \oplus a_1x_1 \oplus \dotsb \oplus a_nx_n$, where $x_1 \dotsc x_n$ are the bits of $x$ and $a_0 \dotsc a_n$ are arbitrary bitstrings. |
|
Nov 24 |
answered | Is a book cipher provably secure? |
|
Nov 23 |
revised |
Using a Non-Random IV with modes other than CBC added 309 characters in body |
|
Nov 23 |
revised |
Using a Non-Random IV with modes other than CBC added 406 characters in body |
|
Nov 23 |
answered | Using a Non-Random IV with modes other than CBC |
|
Nov 23 |
revised |
copy-protection wiki excerpt added 181 characters in body |
|
Nov 23 |
suggested | suggested edit on copy-protection tag wiki excerpt |
|
Nov 23 |
wiki | created copy-protection excerpt |
|
Nov 23 |
revised |
license-key wiki excerpt added 188 characters in body |
|
Nov 23 |
suggested | suggested edit on license-key tag wiki excerpt |
