Reputation
17,032
Next tag badge:
94/100 score
37/20 answers
Badges
2 25 72
Impact
~410k people reached

Jun
17
revised Choose a random number that is different from a bunch of other secret numbers
edited tags
Jun
17
comment Choose a random number that is different from a bunch of other secret numbers
For practical applications, how large will $x$ be? Can the "not clash" guarantee be probabilistic? In other words, if $x>>n$ (where $n$ is the number of participants), with very high probability, a randomly generated value will not clash. If that is sufficient for your needs, then a multi-party random number generation algorithm would suffice.
Jun
17
comment RSA: Common modulus attack problem
For the one that is negative, say $s_2$, you should calculate $c^{-s_2}\bmod{n}$ (that way $s_2$ is positive), then find the modular inverse of that value (mod n).
Jun
16
comment RSA: Common modulus attack problem
Duplicate of how to use common modulus attack?. P.S. (from the help center) "please provide an indication of what you are not understanding/need clarification on and your attempts at solving it, so we have a clear indication of where you are stuck. This goes for all questions, not just homework. If you have just written out your assignment, your question will be closed."
Jun
13
comment Algorithm accepting every passphrase to fool unlegit user
Take a look at this recent work from MIT.
Jun
12
awarded  Revival
Jun
12
comment Python KDF - Master Key and Derivatives
@pwn.star You couldn't find any? Did you try this?
Jun
12
comment Python KDF - Master Key and Derivatives
Please don't cross-post, it is not allowed on the SE network.
Jun
12
reviewed Approve Python KDF - Master Key and Derivatives
Jun
12
reviewed Approve Python KDF - Master Key and Derivatives
Jun
12
revised What functions allow for practical indistinguishability obfuscation?
added 35 characters in body
Jun
12
comment Universal Circuits in Indistinguishability Obfuscation Candidate Construction
Welcome to the site. Glad to have you here!
Jun
12
revised FHE - Brakerski's “Scale Invariant” Scheme
added 26 characters in body
Jun
11
comment Mixing Entropy Sources by XOR?
Should be fine. Think of one-time-pad. For an attacker that doesn't know the key, it is still perfectly secure no matter what the plaintext was.
Jun
10
comment Generate a unique 64 bit numeric database key from a string without collisions at $2^{32}$ birthday threshold?
Why do you think that "two similar strings are unlikely to produce the same hash code"? If you look at MD5 collisions that are out there, it is the opposite. Many of the (MD5) colliding strings are very similar.
Jun
9
awarded  Revival
Jun
7
comment Obfuscate an “I'll reveal if you do” function
Should it be $V(C(x,r),x',r')=0$ if $x\neq x'$ or $r\neq r'$?
Jun
7
revised Prime factorization of RSA modulus
edited tags
Jun
7
revised New PRG from old
edited tags
Jun
7
revised Break double encryption
edited tags