3,482 reputation
1519
bio website
location United States
age
visits member for 2 years, 9 months
seen 59 mins ago

11h
comment How important is the evenness of the distribution when finding random primes?
crypto.stackexchange.com/q/1812/991 $\:$ crypto.stackexchange.com/q/690/991 $\;\;\;\;$
11h
comment Is this an acceptable All-or-Nothing Transform?
It's just confusing, since you use "$H$" for something quite different. $\:$ You could say "and a source of (pseudo)random bits". $\;\;\;\;$
12h
comment Is this an acceptable All-or-Nothing Transform?
I don't see any reason to use $G$. $\;$
14h
comment Is this an acceptable All-or-Nothing Transform?
In that case, should "Extract $b$ bits ... $G$" be replaced with "Generate a random block of $b$ bits"? $\hspace{.6 in}$
15h
comment Is this an acceptable All-or-Nothing Transform?
"the resulting blocks $m_{1}$, $m_{2}$, $\ldots$, $m_{n}$" $\;$
16h
comment Is this an acceptable All-or-Nothing Transform?
"from $G$" $\: \mapsto \:$ "from those blocks with $G$" $\;\;\;$ ? $\;\;\;\;\;\;\;$
1d
comment Public key Issue - same key pair as existing one?
More relevantly, does 2**2024.5 look big? $\;$
1d
comment Public key Issue - same key pair as existing one?
@CodesInChaos : $\;\;$ On the other hand, except for 3-prime 1024-bit RSA, I don't know of any way to give a mathematical proof that the "probability of colliding RSA keys is much smaller than that if you use" primes compatible at least one $\: e \in \{3,\hspace{-0.03 in}5,\hspace{-0.04 in}17\} \:$ or with $\: e = 257 \:$ specifically that are otherwise chosen perfectly at random. $\;\;\;\;\;$
1d
comment The REACT transform and Replayable CCA
Also, "an IND-secure symmetric encryption scheme" with respect to CPA or CCA? $\hspace{1.51 in}$
2d
comment The REACT transform and Replayable CCA
You might be interested in one of these two papers. $\;$
2d
comment Implementing CD serial key system
What do you mean by "use a threshold approach"? $\;$
Jul
27
comment Reversing DJB2 Hashes
If you can do that, then you should have said so, since your reverse algorithm doesn't. $\hspace{.95 in}$
Jul
27
comment Reversing DJB2 Hashes
This is an alternative to your algorithm (and one that actually accounts for $\hspace{1.9 in}$ r being implicitly modded by $2^{32}$). $\;$
Jul
27
comment How to convert FLOPS (or PFLOPS) to guesses per second?
... for what password hashing algorithm? $\;$
Jul
26
comment True Random Number Generator by milliseconds per keystroke (TRNG-Kms)
@xorcoder : $\;\;\;$ His previous comment does say that "CSPRNG is a subclass $\hspace{1.74 in}$ of PRNG and was of course implied.". $\;\;\;\;\;\;\;$
Jul
26
comment Probability that two different files can have same MD5 hash for both an unencrypted and encrypted version (AES256, same key between files)
@marstato : $\:$ In fact, AES25 is even less precise than AES256. $\;\;\;\;$
Jul
26
comment True Random Number Generator by milliseconds per keystroke (TRNG-Kms)
er, I guess the last of those papers isn't actually helpful, since your data probably doesn't have that much entropy. $\:$ I would recommend using one of the middle paper's algorithms, since it seems likely to me that randomish key-presses would behave as a small-space source. $\;\;\;\;$
Jul
26
comment True Random Number Generator by milliseconds per keystroke (TRNG-Kms)
people.seas.harvard.edu/~salil/pseudorandomness/extractors.pdf $\:$ homes.cs.washington.edu/~anuprao/pubs/small-space.pdf $\:$ cs.nyu.edu/~dodis/ps/2-ext.pdf $\hspace{.89 in}$
Jul
26
comment Reversing DJB2 Hashes
But, but, how is that supposed to help you figure out which values of C to investigate? $\;$
Jul
26
comment Reversing DJB2 Hashes
... why are you doing computations mod 33? $\;$