5,070 reputation
1723
bio website
location
age
visits member for 2 years, 5 months
seen Jul 26 at 2:10

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.
Jan
6
comment Shared secret: Generating Random Permutation
How are you going to enforce such a requirement? Suppose Alice, Bob and Carol are playing. Alice has already folded but remain online. Bob has gone all-in but realizes he is about to loose just before the last card is to be revealed. Bob privately asks Alice to pull the plug. Alice pulls the plug.
Jan
6
comment Shared secret: Generating Random Permutation
Please note that any mental poker protocol would leave you with a problem of how to fold, if there are more than two players. If all players have to be present to decrypt the next card, one player might simply go offline and make it impossible for the remaining players to complete the game. If you solve that by using threshold secret sharing, you introduce a possibility of collusion.
Dec
31
reviewed Approve suggested edit on Why nobody considers counter re-keying as a standard Block Cipher Mode?
Dec
30
answered Where is my private key stored when I communicate to a website that uses SSL/TLS?
Dec
30
comment Random Number Generation with a Entropy pool versus Seed
Your first paragraph is a bit fuzzy. If you need a cryptographically secure pseudo random number generator, it is because you need cryptographically secure pseudo random numbers, and whatever that reason might be, it is cryptographic by definition. If not, you might need a PRNG, but not necessarily a CSPRNG, and should probably ask elsewhere.
Dec
28
comment Can an RSA public key be generated without ever knowing the factors?
crypto.stackexchange.com/questions/9191/…
Dec
27
accepted Private Messaging
Dec
23
comment Single Party Encryption, Multi Party Decryption
Benaloh's scheme seems to be exactly what I am asking for, yes. On the negative side, though, the scheme uses commitments that induce an overhead for the mixes by a factor greater than 100 (with the parameter values recommended in the paper). It is obvious that there would be a risk for integrity if only two commitments were used by each mix, but would it lead to a risk of compromised anonymity?
Dec
23
comment Single Party Encryption, Multi Party Decryption
I am missing your thoughts on how, exactly, this might be applied to a mixnet scheme.
Dec
22
revised Single Party Encryption, Multi Party Decryption
added 403 characters in body
Dec
22
comment How does a backdoor in the RNG enable an attacker to break encryption protocols?
schneier.com/blog/archives/2007/11/the_strange_sto.html
Dec
21
reviewed Approve suggested edit on mixnets tag wiki
Dec
21
reviewed Approve suggested edit on mixnets tag wiki excerpt