meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 9 months |
| seen | 37 mins ago | |
| stats | profile views | 137 |
|
May 1 |
comment |
What does the expression $1^n$ mean as a function argument? If you want to understand why the $1^n$ is there and what purpose it solves, see crypto.stackexchange.com/q/8174/351. |
|
May 1 |
comment |
Why does key generation take an input $1^k$, and how do I represent it in practice? I've edited the question to be more general, so that it'll be helpful to others as well. (As it turns out, this question is not specific to the McEliece cryptosystem.) |
|
May 1 |
revised |
Why does key generation take an input $1^k$, and how do I represent it in practice? added 179 characters in body; edited tags; edited title |
|
May 1 |
revised |
Why does key generation take an input $1^k$, and how do I represent it in practice? added 487 characters in body |
|
May 1 |
answered | Why does key generation take an input $1^k$, and how do I represent it in practice? |
|
May 1 |
revised |
Proof that padded RSA is CPA-secure added 1445 characters in body |
|
May 1 |
revised |
Proof that padded RSA is CPA-secure added 1351 characters in body |
|
May 1 |
revised |
Proof that padded RSA is CPA-secure added 53 characters in body |
|
May 1 |
answered | Proof that padded RSA is CPA-secure |
|
May 1 |
reviewed | Approve suggested edit on Sematically Secure McEliece |
|
Apr 30 |
comment |
Adversary Two Stages What "new"? The word "new" never appears in the quote you provided, so I'm not sure where you got that from or why you are asking. Perhaps you might want to spell out any assumptions you are making in more detail. Here's a hint: Ask yourself, why would you expect the ciphertext or its corresponding plaintext to be new? Answer: The plaintext that's encrypted isn't necessarily new; it's not known to the attacker (it might be one of multiple possibilities, and the attacker doesn't know which), but that doesn't mean it's new. It can be unknown without being new. |
|
Apr 27 |
comment |
Is this scheme a provably fair random number generation? @StephenTouset, the original poster is correct that you need to send $m$ to the client. $p$ is a number in the range $0\ldots n-1$, so it only reveals the value of $m \bmod n$; it does not reveal the full value of $m$. Thus, you need to send the full $m$ as well. In practice, it is enough to send just $m$ (there is no need to send $p$ too, since the client can re-derive it), but that's probably not a big deal in practice. |
|
Apr 25 |
revised |
Is this scheme a provably fair random number generation? added 168 characters in body |
|
Apr 25 |
comment |
Is this scheme a provably fair random number generation? @DavidSchwartz, I think the original poster took care of this by choosing $m$ uniformly at random from between 0 and one less than a multiple of $n$. |
|
Apr 25 |
reviewed | Approve suggested edit on Keys required for cryptography |
|
Apr 25 |
answered | repeating-key xor and hamming distance |
|
Apr 24 |
answered | Is this scheme a provably fair random number generation? |
|
Apr 24 |
answered | What does “securely realize” mean? |
|
Apr 24 |
revised |
What does “securely realize” mean? Clean up the language a little bit. |
|
Apr 20 |
awarded | Mortarboard |
