Reputation
20,909
Next tag badge:
71/100 score
19/20 answers
Badges
2 34 89
Impact
~574k people reached

1d
comment How does hash speed vary based on string length?
I think you should say "scales linearly". That seems important from the OP's question.
2d
answered What is base of $log$ in Subexponential Algo for DLP?
2d
comment What is base of $log$ in Subexponential Algo for DLP?
See also this
2d
comment What is base of $log$ in Subexponential Algo for DLP?
See this answer starting at "However, note..."
2d
reviewed Approve Possible to generate a one time secret which all nodes on the distributed network can know but cannot pre compute
Feb
10
comment Possible to generate a one time secret which all nodes on the distributed network can know but cannot pre compute
Is the "secret" suppose to be known only to the 5,000 nodes? Or can it be generated by anyone, just not generated until the right time? In other words, is your P2P network closed?
Feb
10
comment Possible to generate a one time secret which all nodes on the distributed network can know but cannot pre compute
OP, it looks like you have multiple accounts. You need to merge them so you can edit your own question and comment on answers.
Feb
10
reviewed Approve Possible to generate a one time secret which all nodes on the distributed network can know but cannot pre compute
Feb
10
comment Possible to generate a one time secret which all nodes on the distributed network can know but cannot pre compute
@MikeOunsworth I see your point. There are some ambiguities in the question, in my opinion. For example, is the network open to all? If so, why not use public data? If not, you are correct. I'll ask for clarification.
Feb
10
revised Possible to generate a one time secret which all nodes on the distributed network can know but cannot pre compute
added 213 characters in body
Feb
10
answered Possible to generate a one time secret which all nodes on the distributed network can know but cannot pre compute
Feb
10
reviewed Approve Possible to generate a one time secret which all nodes on the distributed network can know but cannot pre compute
Feb
10
comment RSA private key finding method
Maybe she beats Bob with $5 wrench until he tells her the private key.
Feb
10
comment Fast MAC for 64-bit inputs
What is a hash collision DoS? Are you worried that an attacker will send you a bunch of values that all result in the same hash, making your hash table inefficient?
Feb
10
comment Fast MAC for 64-bit inputs
For hash tables, you don't really need cryptographic hashes. So this should probably be migrated to Computer Science.
Feb
9
revised How do substution-permutation networks work?
edited title
Feb
9
comment Need CryptDeriveKey AES implementation in C#
I don't really understand what your question is.
Jan
30
comment When all shares of a secret are given to adversary as a permuted matrix
@user153465 simply multiplying the shares with the same index would give you a sharing of the product. There are 2 problems with this, however. 1) The threshold has doubled. So if you were doing $t=n/2$ out of $n$ secret sharing, you would now need all $n$ shares to reconstruct. 2) The coefficients of the polynomial that results in the sharing of the product are not independent. The only way we know around this is to use interaction.
Jan
30
comment When all shares of a secret are given to adversary as a permuted matrix
@user153465 you mean so that you end up with shares of the product of the two secrets?
Jan
28
comment When all shares of a secret are given to adversary as a permuted matrix
Is the permutation fixed or how is the permutation generated?