meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 9 months |
| seen | yesterday | |
| stats | profile views | 14 |
|
Aug 20 |
comment |
What is the most secure hand cipher? +1: The [one-time pad[(en.wikipedia.org/wiki/one-time_pad) is the most secure cipher, period. |
|
Aug 14 |
comment |
Random decomposition of symmetric key Does the description for the secret-sharing tag sound like what you are trying to do? |
|
Aug 10 |
comment |
Is there a simple hash function that one can compute without a computer? Perhaps when we find a good hand hash, we could also use it for generating site-specific passwords which can be executed in my own head?. |
|
Aug 10 |
comment |
Do I have to recompute all hashes if I change the work factor in bcrypt? @PaŭloEbermann: Ah, right -- some password hash functions allow one to "continue", but not bcrypt. |
|
Aug 8 |
comment |
Secure private key storage related: "How to create Java Key Store (.jks) file with AES encryption?" |
|
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 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 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? |
|
Jun 29 |
comment |
Algorithm to securely exchange identities @RickyDemer: After some thought, I now think you are right --each package only needs to go through each participant once. |
|
Jun 19 |
comment |
How to represent a 32-byte SHA2 hash in the shortest possible string? @fgrieu: good point. Rather than the original base64, Geotarget probably wants RFC 4648 'base64url' "Base64 with URL and Filename Safe Alphabet". In order to guarantee that a program won't generate a base filename of "con" or some other reserved filename, and to make human-generated filenames such as "readme" usually sort before program-generated filenames, I typically make program-generated filenames start with lowercase 'z'. |
|
May 21 |
comment |
Software implementation of a commutative cipher? possibly related: Algorithm Design for only Mutual Information Sharing |
|
May 3 |
comment |
Software implementation of a commutative cipher? @IlmariKaronen: Yes, good point. |
|
Oct 17 |
comment |
What is the difference between a stream cipher and a one-time-pad? Since the one-time-pad was actually used, it is not mythical. For example, the original Moscow–Washington hotline starting in 1967 used a one-time pad. |
|
Sep 2 |
comment |
Types of Cryptography for a 4-8 bit microcontroller +1: these look useful and relevant. Thank you. |
|
Aug 31 |
comment |
How to collect, process, and transmit data securely? Does this data need to be secret (as in a secret ballot), or would it be OK if all of the data and all the final results were revealed to everyone? |
|
Aug 30 |
comment |
Looking for cryptographic secure hash algorithm(s) that produces identical root hash for differently sliced hash list @D.W. Good points. In the best case -- a segment of length 2^n blocks, and starts and ends on a boundary that is a multiple of 2^n blocks -- the user only needs to send 1 hash with (the encrypted version of) that segment to the server. In the worst case -- a segment of of length (2^n - 1) blocks -- the user needs to send O(log k) hashes, as you said, but the server doesn't need to "retain" any of them -- once it has all the hashes for all parts of the file, the server can calculate the one root hash and then discard all the other hashes. |
