Reputation
5,962
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
1 8 22
Newest
 Informed
Impact
~66k people reached

Feb
19
comment Why does the FBI ask Apple for help to decrypt an iPhone?
@aroth : ​ Presumably the flash chips are "what's preventing the FBI from" "creating a bitwise copy of them". ​ ​ ​ ​
Feb
18
comment Why are recomended RSA key lengths so high?
The biggest paragraph in your question refers to a smaller number. ​ ​
Feb
18
comment Why are recomended RSA key lengths so high?
This announces the factorization of a larger number. ​ ​
Feb
17
comment Can a secure MAC break if the adversary is given oracle access to Verify?
Also, if [there is a MAC scheme that's secure against adversaries that don't have a verification oracle] then there is a MAC scheme with deterministic tagging algorithm such that [a verification oracle lets an adversary very easily break the scheme] and [the scheme is otherwise secure]. ​ ​
Feb
17
comment Can a secure MAC break if the adversary is given oracle access to Verify?
cstheory.stackexchange.com/q/20939/6973 ​ ​
Feb
15
comment Unkeyed, fast, one-way PRP
crypto.stackexchange.com/q/14338/991 ​ ​
Feb
15
comment Unkeyed, fast, one-way PRP
As pg1989 explains, unkeyed PRPs can only exist for domains with at most 1 element. ​ ​
Feb
14
comment Is the concept of provably secure hash the same as entropy smoothing hash functions?
"entropy smoothing" appears to be the same as "a strong extractor". ​ ​
Feb
13
comment Fast MAC for 64-bit inputs
"keys" ​ -> ​ "public inputs" ​ ​ ​ ? ​ ​ ​ ​ ​ ​ ​ ​
Feb
13
comment Weighted secret sharing scheme?
If the weights have a unary common denominator, then you can give each party a number of shares corresponding to its numerator. ​ ​
Feb
13
answered Can we share an n-bit string by using shamir's secret sharing n times?
Feb
13
comment Is there a way to create an encrypted email with no third party application
Oh, this question actually makes more sense than I'd originally thought. ​ (I had missed its initial "other".) ​ ​ ​ ​
Feb
13
comment Is there a way to create an encrypted email with no third party application
en.wikipedia.org/wiki/One-time_pad ​ ​
Feb
13
comment How can I figure out a hash algorithm?
Does it appear to have the avalanche effect? ​ ​
Feb
11
comment What is base of $\log$ in Subexponential Algo for DLP?
Oh, yeah. ​ ​ ​
Feb
11
comment What is base of $\log$ in Subexponential Algo for DLP?
@mikeazo : ​ It does matter here, since these logs are in the exponent. ​ ​ ​ ​
Feb
11
comment What is base of $\log$ in Subexponential Algo for DLP?
It's definitely not base 10. ​ The question should've been whether they're base e or 2. ​ ​ ​ ​
Feb
9
comment How is a message digest decrypted?
See these two questions. ​ ​
Feb
7
comment How to find roots of equation $f(x)=0 \pmod p $, where $p$ is prime number?
@poncho : ​ It's analogous to how "the roots might be in" $\mathbb{C}$ even if the coefficients are all in $\mathbb{R}$. ​ ​ ​ ​
Feb
7
comment Why does a non-prime DH modulus creates a “NOBUS” backdoor
"do-able in" ​ -> ​ "do-able in groups of order" ​ ​ ​ ? ​ ​ ​ ​ ​ ​ ​ ​