Apparently, this user prefers to keep an air of mystery about them.
24 Meaning of: “If factoring large integers is hard, then breaking RSA is hard, is unproven” Dec 13 '15
8 Is there any efficient algorithm for primality testing for numbers that are of the form $4k+3$ using the square root function? Dec 10 '15
6 Correctness of Freivald algorithm for checking matrix multiplication, why is the probability of checking $AB \neq C$ at least 1/2? Nov 3 '15
5 Why is the path compression (no rank) for disjoint sets $O(\log n)$ amortized for Find-Set? Dec 4 '15
4 Is computing a square root of a number and having more than 2 roots a reliable way to decide primality? Dec 14 '15
4 If a one-way functions (OWF) exist, then there exits a OWF that is computable in quadratic running time by a padding argument Jan 6 '14
3 What does “refuting random 3CNF” formulas mean? May 9 '15