8 reputation
2
bio website
location
age
visits member for 4 months
seen Dec 28 '13 at 5:10

Dec
12
awarded  Scholar
Dec
12
accepted Diffie-Hellman: Does the size of the prime modulus depend on the potential size of the secret?
Dec
10
awarded  Student
Dec
10
comment Diffie-Hellman: Does the size of the prime modulus depend on the potential size of the secret?
Since OTP requires perfect informational secrecy by definition, what would you suggest I refer to this scheme as? Just a "stream cipher"? I referred to it as a One Time Pad because, aside from the fact that information about they keys is leaked, it seems to be the same idea otherwise. Couldn't using a key derivation function open up my system to exhaustive search? Wouldn't there still be an advantage to each message character having its own random shift? In case I didn't mention(and in case it's important), only truly random numbers are being used.
Dec
10
comment Diffie-Hellman: Does the size of the prime modulus depend on the potential size of the secret?
Okay, I read a little more on the discrete logarithm problem. (I swear I couldn't find much specific on it last night. Haha) So would I be correct in saying that the discrete logarithm problem can be solved easily when the prime modulus is small but it becomes increasingly difficult to solve the larger the prime gets?
Dec
10
asked Diffie-Hellman: Does the size of the prime modulus depend on the potential size of the secret?