| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 8 months |
| seen | 2 hours ago | |
| stats | profile views | 14 |
|
Aug 9 |
answered | Entropy of system data - use all and hash, or trim least significant bits? |
|
Aug 8 |
answered | Secure private key storage |
|
Aug 8 |
comment |
Secure private key storage related: "How to create Java Key Store (.jks) file with AES encryption?" |
|
Aug 3 |
answered | Is there a simple hash function that one can compute without a computer? |
|
Jul 31 |
wiki | created host-proof description |
|
Jul 31 |
wiki | created host-proof excerpt |
|
Jul 30 |
comment |
What is the difference between a stream cipher and a one-time-pad? The one-time pad and Venona project articles say that the USSR and a few other organizations heavily used physical pads of random-looking letters called one-time pads. I think it's pretty likely that practically all of those pads were, in fact, generated with a 100% physical RNG, although I don't really have any evidence one way or another. I suspect that we may never know exactly how those pads were generated. |
|
Jul 30 |
comment |
How do I calculate CRC32 mathematically? Does "A Painless Guide to CRC Error Detection Algorithms" help? |
|
Jul 30 |
comment |
Is there a simple hash function that one can compute without a computer? Variation: In addition to forcing every entry in the input column to be unique, also force every entry in the output column to be unique. I.e.: After writing new input on the paper, flip a quarter 8 times, writing the output on scratch paper. If the scratch 8-bit output pattern is already in the output column, to prevent collisions, repeat flipping the quarter 8 more times. When you eventually get a scratch 8-bit output pattern not already in the output column, copy it to the output column. Alas, this variant is awkward for more than 128 unique inputs, and fails after 256. |
|
Jul 28 |
answered | Should I use md5 for my new application? |
|
Jul 24 |
awarded | Commentator |
|
Jul 24 |
comment |
Trying to find an algorithm to share portions of a key with multiple people In particular, there are several open-source implementations of this algorithm, such as ssss-split and ssss-combine and Life, Death, and Splitting Secrets. |
|
Jul 24 |
revised |
Relation between Threshold Cryptosystem and Secure Multiparty Computation ? edited tags |
|
Jul 24 |
answered | PRNG taking advantage of very large seed |
|
Jul 22 |
revised |
Encryption algorithm that produces dummy output on incorrect passwords edited tags |
|
Jul 22 |
revised |
Encryption algorithm that produces dummy output on incorrect passwords edited tags |
|
Jul 21 |
revised |
Is there a standard for OpenSSL-interoperable AES encryption? one more thing ... |
|
Jul 21 |
asked | Is there a standard for OpenSSL-interoperable AES encryption? |
|
Jul 21 |
comment |
Is this design of client side encryption secure? @AndreyBotalov: It's pretty tedious to "review" (or to ask "others" to review) a JavaScript application that could potentially be different every time it is downloaded from the server, potentially downloaded several times per user per day. Is there a good way to at least check if the version of the app I downloaded today is the same as the version I and others previously reviewed yesterday? |
|
Jul 21 |
revised |
Uncompress the winRar password protected file without password. (not brute force attacking) added 960 characters in body |