Reputation
7,026
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
1 14 38
Newest
 Enlightened
Impact
~182k people reached

Jan
16
reviewed Approve Guarding against cryptanalytic breakthroughs: combining multiple hash functions
Jan
16
reviewed Approve Are there any advantages in using proprietary encryption?
Jan
16
comment Is it safe to use XOR to encrypt data key using master key
crypto.stackexchange.com/questions/2264/…
Jan
15
answered Does frequent key change weaken encryption?
Jan
11
comment Encryption used in a commercial software product
Your question is off-topic here. I suggest that you ask this question to the software manufacturer directly.
Jan
9
reviewed Approve openssl tag wiki
Jan
9
reviewed Approve openssl tag wiki excerpt
Jan
9
answered Why can’t the public key exponent in RSA be negative?
Jan
8
reviewed Approve What is an impure NIST true random number generator?
Jan
6
comment Protocol to identify zone of potential agreement without revealing reservation prices and having to trust third parties?
A somewhat related problem would be how to eliminate the risk of collusion. Suppose A is working with C, who is the "real" prospective buyer from B. A proposes a maximum price that is lower than what C is prepared to pay, and communicates the result to C, before C and B executes the protocol. This way C is able to start the negotiation with an offer that leads to a final price that is closer to B's minimum.
Jan
3
comment Is CPU timing jitter a usable entropy source?
I've been using CPU timing jitter as entropy source on a wide variety of CPU models since 2001. Perhaps the most important observation is that it has become more risky on modern multicore CPUs. If you are not careful, you might end up harvesting entropy from a core that is not used for anything else, meaning you will either end up with a poor entropy source, or be stuck in an endless loop.
Jan
2
comment Homemade Randomized RSA
Suppose you take a guess at $m$. Will you be able to tell if $(A,B)$ is an encryption of $m$ or not? (You will.)
Jan
1
revised Shamir's Secret Scheme : Knowing the threshold
added 403 characters in body
Dec
28
comment Shamir's Secret Scheme : Knowing the threshold
@IlmariKaronen I understand, but shouldn't the fact that we are dealing with polynomials and not random functions affect that probability?
Dec
28
comment Shamir's Secret Scheme : Knowing the threshold
@IlmariKaronen Are you sure the probability is exactly $1/q$? I agree with the approximation, but would presume that two polynomials of degree $k+1$ and $t-1$, with $k+1 < t-1$, might intersect in up to $t-1$ different points; not $k+1$ points.
Dec
28
revised Shamir's Secret Scheme : Knowing the threshold
added 248 characters in body
Dec
28
answered Shamir's Secret Scheme : Knowing the threshold
Dec
18
reviewed Approve Clarification regarding multiple modular exponentiation
Dec
14
reviewed Close How much stronger is RC4 if it is keyed with an RSA private key?
Dec
14
comment Cost of attack on DSA with attack on DLP
You can't "optimize" Pollard Rho. It is what it is. You can however (a) modify the algorithm to use various trade-offs, or (b) optimize the implementations of the underlying arithmetic operations. In the former case you will get a different algorithms. which might or might not be faster depending on a lot of factors. In the latter case you might get a speed up by a constant factor.