network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 4 months |
| seen | Mar 18 at 15:54 | |
| stats | profile views | 1 |
|
Oct 26 |
comment |
Seed a PRNG with random data and a password Thanks, nice simple idea. |
|
Oct 26 |
accepted | Seed a PRNG with random data and a password |
|
Oct 24 |
awarded | Editor |
|
Oct 24 |
revised |
Seed a PRNG with random data and a password Added some more details about the PRNG and seed size. |
|
Oct 24 |
comment |
Seed a PRNG with random data and a password Good question. I guess I've been assuming the key file is the same size as the seed, which I think will be a fair assumption for this application. |
|
Oct 24 |
asked | Seed a PRNG with random data and a password |
|
Jul 27 |
accepted | PRNG taking advantage of very large seed |
|
Jul 27 |
comment |
PRNG taking advantage of very large seed @DavidSchwartz: Ok, I think I finally get it now =). Just use a good PRNG and I don't have to worry about "making the most" of my random seed. That being said, it probably doesn't do any good to use a seed that's bigger than the PRNGs internal state, right? |
|
Jul 17 |
awarded | Commentator |
|
Jul 17 |
comment |
PRNG taking advantage of very large seed I'm not worried about brute force: I'm worried about patterns in the output if I have to generate thousands of times more data than what is in the seed. Is that what you mean by the strength of the PRNG? |
|
Jul 17 |
comment |
PRNG taking advantage of very large seed @CodeInChaos: Can you elaborate on that? How does several thousand bits of true random data not increase security over 512 bits? |
|
Jul 17 |
comment |
PRNG taking advantage of very large seed Alternatively, if anyone can point me to a good hash function which has a configurable, arbitrarily long output size, I could use that with PBKDF2 with a hash size equal (or almost equal) to the amount of input data I have. |
|
Jul 17 |
comment |
PRNG taking advantage of very large seed Thanks Ricky. No offense, I'm trying to avoid things that people "just came up with" =). I'm hoping there's a standard peer reviewed and time tested technique for doing this. Your idea sounds perfectly reasonable to me, but I'm no expert. Anyway, I think a variant of your idea would be to use Fortuna, or something very Fortuna like (i.e., set the number of entropy pools high enough to cover all of the input data). |
|
Jul 17 |
asked | PRNG taking advantage of very large seed |
|
Mar 20 |
comment |
If plaintext is random, how does it affect my choice of encryption algorithm? No good reason. Mostly just so I didn't have to put in the effort of finding, using, and distributing a library to do the encryption. But given the potential risks, I guess I'll just suck it up and find one =). Thanks for the lead on a new topic to study. |
|
Mar 20 |
comment |
If plaintext is random, how does it affect my choice of encryption algorithm? Thank you, a very clear answer. I feel stupid for not thinking of this =). |
|
Mar 20 |
accepted | If plaintext is random, how does it affect my choice of encryption algorithm? |
|
Mar 19 |
asked | If plaintext is random, how does it affect my choice of encryption algorithm? |
|
Mar 19 |
comment |
Can PBKDF2 be used to create an OTP to encrypt random plaintext? Well I guess that's really my question, isn't it? Are there any such weaknesses, (biases, etc) in PBKDF-2 as I've described? I see your point (and everyone else's) that neither it, nor hash functions, were designed for this and so haven't been tested for it, and so maybe they have weaknesses, maybe they don't, but noone's really looked into it. Thanks for the input. |
|
Mar 1 |
accepted | Can PBKDF2 be used to create an OTP to encrypt random plaintext? |
