xagawa
Reputation
1,413
Next privilege 1,500 Rep.
Approve tag wiki edits
 Apr21 awarded Yearling Apr17 revised Given a message and signature, find a public key that makes the signature valid (ECDSA) (s_1,k_1) -> (s_1,r_1) as @Ruggero pointed out. Describe the attack. Apr17 comment Given a message and signature, find a public key that makes the signature valid (ECDSA) Thank you for pointing out my mistake. Well, I correct the form of the signature. But, please notice that the attack I described does not require knowledge of $k_1$. Apr6 comment Pseudorandom Function Proof what happens if I query x=011...1 to your second candidate? Feb24 revised Randomness re-use in LWE encryption scheme Correct minor typo Feb24 comment Randomness re-use in LWE encryption scheme I'm sorry that I omit the details. I used the generalized leftover hash lemma, instead of the leftover hash lemma. Since $rb$ leaks $\log{q}$-bit information of $r$, I set $m \geq (n+2) \log q\ \ldots$ instead of $m \geq (n+1) \log q\ \ldots$. I'll add more explanations. Feb23 answered Randomness re-use in LWE encryption scheme Feb23 comment Zero Knowledge Non Interactive Proof with random oracle Hint: Notice that the simulator can program the random oracle and the original protocol is honest-verifier ZK. Dec5 awarded Revival Sep30 awarded Explainer Aug20 reviewed Approve S-box with differential uniformity = 2 Aug4 comment Public key in fully homomorphic encryption over the integers What happens if you set it even? Jul24 comment Universal hashing techniques based on matrix multiplication Proving \epsilon-universality of random matrix hashing sounds an execise. I once found proofs in Shoup's textbook. Jun8 reviewed Approve Why are there only positive value points on an elliptic curve? Jun8 reviewed Approve RSA encryption and signature padding flaw Jun1 comment Reductionist proofs of decisional problems to computational Do you need more explanation or easier one, e.g., "SearchLWE vs DecisionalLWE"? May29 revised Reductionist proofs of decisional problems to computational Add overview of CDH <= BitCDH. May28 answered Reductionist proofs of decisional problems to computational May27 comment Is there a public-key cryptography method that enables public keys to be much smaller than private keys? Stretching a secret key often appears in the context of leakage-resilient cryptography. May21 revised How can one encrypt with RSA (or ElGamal) without revealing whom the ciphertext is intended for? added 55 characters in body