30,833 reputation
12463
bio website
location
age
visits member for 3 years, 2 months
seen 15 mins ago

Apr
15
comment Does IKEv2 protocol have two modes like IKE
@Gev_sedrakyan: I tried to cover that in my answer; during initial SA bring up, IKEv2 does not have one set of exchanges to bring up the IKE SA, and then a second set to bring up the IPSec SA; it's done with one set. Now, afterwards, there is a "Child SA" exchange; that's used both as a "non-initial Quick Mode" (both to rekey IPSec SAs, and to create new ones), and as a way to rekey an IKE SA (which IKEv1 doesn't do; it does an independent Main Mode/Aggressive Mode to "rekey" an IKE SA).
Apr
15
comment Does IKEv2 protocol have two modes like IKE
@Gev_sedrakyan: actually, they are separate, for example, you can rekey one without the other, and one IKEv2 SA can parent multiple IPSec SAs simultaneously. However the IKEv2 mandates that they be initially generated at the same time, and that they are related in a closer way than what IKEv1 mandated.
Apr
15
revised Does IKEv2 protocol have two modes like IKE
Expanded explination
Apr
15
revised Does IKEv2 protocol have two modes like IKE
edited tags
Apr
15
answered Does IKEv2 protocol have two modes like IKE
Apr
14
comment Exchanging Keyspace and Message space in PRF
Have you tried to construct an $F$ for which $F(Key, Message)$ is a secure PRF, but $F(Message, Key)$ is not?
Apr
14
comment does re-encrypting the same value with multiple keys reduce security
@ZackNewsham: as far as we know, multiple encryptions to different keys is not harmful in CBC-mode, even if the plaintext consisted of a single block, and even if the IV was constant between all encryptions (there are other reasons to randomize IVs; it just happens to be OK in this scenario).
Apr
14
answered does re-encrypting the same value with multiple keys reduce security
Apr
14
answered How to make sure the pre-agreed information safe for DH-Key Exchange
Apr
12
comment Why are collision attacks important when talking about MAC schemes?
I would like to point out that this arguments doesn't work when you start talking about MACs with nonces; in that case, if you model the nonce as a part of the state, then the probability of an internal collision between two different messages may be 0, because the two messages will always have different nonces.
Apr
11
reviewed Approve suggested edit on Is there a simple zero knowledge proof of $x$ for $b=x^x\pmod p$?
Apr
11
answered How to keep phi(n) secret in RSA?
Apr
11
comment How to keep phi(n) secret in RSA?
We don't tell people what it is? The problem of finding $\phi(n)$ given $n$ is a hard problem (if $n$ is hard to factor). So, if we give people a number that they can't factor, and we don't give them $\phi(n)$, they can't determine it on their own.
Apr
11
comment Is there a simple zero knowledge proof of $x$ for $b=x^x\pmod p$?
@tylo: try $x = p^2 - bp + b$. With that $x$, we have $x^x \equiv b \pmod{p}$ as an identity (assuming, of course, that $p$ is prime). Why is this? Hint $y^z \equiv (y \bmod p)^{z \bmod p-1} \pmod{p}$ if $p$ is prime.
Apr
11
comment Is there a simple zero knowledge proof of $x$ for $b=x^x\pmod p$?
@SDL: for prime $p$, it is easy, unless you add in the restriction that $0 < x < p$ as K.G. said.
Apr
10
comment Is there a simple zero knowledge proof of $x$ for $b=x^x\pmod p$?
Actually, if $p$ is prime, the problem of finding an $x$ such that $x^x \equiv b \pmod{p}$ is easy.
Apr
9
answered AES-256 Shift-Rows Offsets
Apr
9
revised What is h in this RSA variant?
added 106 characters in body
Apr
9
revised What is h in this RSA variant?
Added mention to a reference they apparently didn't read
Apr
9
answered What is h in this RSA variant?