482 reputation
212
bio website
location
age
visits member for 1 year, 1 month
seen 16 hours ago

welcome to contact and communicate with me. email in here


2d
comment Is it possible to design an identity-based key-exchange protocol that has (almost) comparable performance with HMQV and enjoys a tight reduction?
maybe you are right, but maybe I can first realise part of what I want to do, that is step by step. In your example, this Ferrari is superfast and has many nice properties but very expensive, but in the market, there maybe other car that outperform Ferrari over certain aspect.
2d
asked Is it possible to design an identity-based key-exchange protocol that has (almost) comparable performance with HMQV and enjoys a tight reduction?
2d
answered In HMQV, can one use multiple identities with one public key?
Aug
29
comment How does Random Oracle and Standard Model differ?
but proof in the random oracles model is easier than that in the standard model. Although there are some flaws with ROM, in a certain cases where a crptosystem is hard to prove in the standard model, then it's not a bad idea to switch to the ROM. At least, it's better than nothing.
Aug
29
comment How to distribute symmetric key between $n$ entities?
maybe group key exchange will also work
Jul
30
awarded  Yearling
May
18
comment Is knowing the private key of RSA equivalent to the factorization of $N$?
when we select $e,d$, generally speaking, if they should $e,d <\phi(N)$ ?
May
12
comment RSA, finding p,q
see my question Is knowing the private key of RSA equivalent to the factorization of N?
May
11
accepted Is knowing the private key of RSA equivalent to the factorization of $N$?
May
9
comment Computational Diffie-Hellman problem over the group of quadratic residues
so if the CDH assumption over $\mathbb{QR}_N$ holds, then CDH assumption $\pmod{p}$ or CDH assumption $\pmod{q}$ may not hold; from other direction if CDH assumption $\pmod{p}$ or CDH assumption $\pmod{q}$ holds ,then certainly CDH assumption over $\mathbb{QR}_N$ holds. If I want to use this correctly, I'd better supposing CDH assumption $\pmod{p}$ or CDH assumption $\pmod{q}$ holds, is that right?
May
9
comment Computational Diffie-Hellman problem over the group of quadratic residues
how large of $p$ or $q$ at least to make sure the hardness of $CDH(U,V) \pmod{p}$ or $CDH(U,V) \pmod{q}$ ?
May
9
asked Computational Diffie-Hellman problem over the group of quadratic residues
May
6
comment Is knowing the private key of RSA equivalent to the factorization of $N$?
@CodesInChaos Do you mean that knowing $(N,e,d)$ if $e$ is big, then we cannot still factor $N$?
May
6
asked Is knowing the private key of RSA equivalent to the factorization of $N$?
Apr
20
comment CDH problem and Square-DH problem
As CDH problem and Square-DH problem are equal, Can I say that Gap-DH problem is equivalent to Square-DH problem equipped with DDH oralce ? It seems that they are equal, but I cannot find a reference to show this, can you provide me some references ?
Apr
15
comment Efficiency of computing $e(P,Q)$ Vs $g^a \pmod{p}$?
"or a given security level (e.g. that of 2048-bit RSA), usual pairings will entail a computational cost which is about 8 to 12 times the cost of decryption with 2048-bit RSA", can you show me some related references to support this sentence?
Apr
15
comment understanding pairing $e:G \times G \to G_T$ and ( Decision)BDH assumption
@tylo : "The only pairing friendly groups we know are all elliptic curves", can you show me some references to support this ?
Apr
13
comment Perfect Forward Secrecy in TLS
where do you read this from? Better provide the source
Mar
19
accepted Efficiency of computing $e(P,Q)$ Vs $g^a \pmod{p}$?
Mar
19
comment Efficiency of computing $e(P,Q)$ Vs $g^a \pmod{p}$?
can I say that the bilinear pairing is always defined over super singular elliptic curve group with large element size, so its computation is time-consuming?