5,416 reputation
1725
bio website
location
age
visits member for 2 years, 7 months
seen 7 mins ago

Feb
2
comment Proof for exponentiation in modular arithemtic
This is a proof by induction. We know it is true for $e = 1$. Using the formula in the answer, we can then prove it is true for $e = 2$ as well, and then for $e = 3$ etc. No matter how large $e$ gets, we might prove that the formula is true for $e + 1$ as well. Hence, by induction, it is true for all integer values of $e$.
Feb
2
comment What is difference between PRG, PRF, and PRP
The difference between a PRF and a PRP is that the PRP is a bijective function and the PRF is not. There are no other differences, but of course this difference has various implications for their respective applications.
Feb
2
answered Why is CBC based on AES malleable in blocks other than the first block?
Jan
30
revised Hardness of finding mutual discrete logarithms of small generators in $\mathbb{Z}_p$
added 3 characters in body
Jan
30
revised Hardness of finding mutual discrete logarithms of small generators in $\mathbb{Z}_p$
added 240 characters in body
Jan
30
revised Hardness of finding mutual discrete logarithms of small generators in $\mathbb{Z}_p$
added 418 characters in body
Jan
29
revised Hardness of finding mutual discrete logarithms of small generators in $\mathbb{Z}_p$
added 136 characters in body
Jan
29
revised Hardness of finding mutual discrete logarithms of small generators in $\mathbb{Z}_p$
added 350 characters in body
Jan
28
comment Secret sharing - no dealer, modifiable, verifiable
If robustness isn't a requirement, also look at Pedersen's original scheme link.springer.com/chapter/10.1007%2F3-540-46416-6_47
Jan
28
comment Secret sharing - no dealer, modifiable, verifiable
This sounds a lot like the Joint-Uncond-Secure-RSS scheme of link.springer.com/chapter/10.1007%2F3-540-68339-9_31. The trick is to let each participant be a dealer, or, put differently, build the scheme around participants who generate their shares randomly.
Jan
28
asked Hardness of finding mutual discrete logarithms of small generators in $\mathbb{Z}_p$
Jan
27
comment How can I find the prime numbers used in RSA?
The approach is just basic algebra. If the factors are close to the floor $x$ of the square root, the equation $r + (x-p)(q-x) - x(q+p-2x)$ will be dominated by the first and third term and the second factor of the third term will consequently be a function of the magnitude of $r$.
Jan
27
comment How cryptographically secure was the original WW2 Enigma machine, from a modern viewpoint?
AES is believed to be (IND-CPA) secure even if the plain text is chosen by the attacker, so why do you include the restriction of no operator errors?
Jan
26
answered What does $\Pi$ represents in cryptography?
Jan
26
revised What does $\Pi$ represents in cryptography?
formatting
Jan
25
revised How can I find the prime numbers used in RSA?
added 439 characters in body
Jan
25
answered How can I find the prime numbers used in RSA?
Jan
14
comment Do I need to prepare plain text before encryption?
I see no obvious harm in anyone following your recommendation, but it is completely pointless as far as cryptographic security goes.
Jan
13
comment Do I need to prepare plain text before encryption?
Compression does not increase the total entropy of the plain text, but it does increase the average entropy per bit, by, well, compressing it. Theoretically, it might increase security in some sense, but only in so far that the compression algorithm effectively hides the length of the original plain text.
Jan
6
comment Shared secret: Generating Random Permutation
To avoid unnecessary confusion: I noted in my comment that a threshold scheme would introduce a risk of collusion and didn't "propose" such a scheme, but only stated a problem.