26,098 reputation
11847
bio website
location
age
visits member for 2 years, 8 months
seen 2 hours ago

Mar
29
awarded  rsa
Mar
27
answered Is it secure to choose d in a RSA key pair?
Mar
26
comment m ∈ Zn \Z*n, RSA works but not secure
You still have the wrong value for $\phi(p)$. $\phi(p)$ is defined to be the number of values between 1 and $p-1$ which is relatively prime to $p$. If $p$ is prime, how many of the values between 1 and $p-1$ are relatively prime to $p$?
Mar
26
reviewed Approve suggested edit on Encryption of numeric value using playfair
Mar
26
answered Is there a time-space tradeoff attack for breaking symmetrical cryptos?
Mar
24
comment How secure is the AES master key if Round Keys are found
I believe that's assuming the key scheduling for AES128. Yes, for AES128, learning any one round key gives you everything. However, the original question specified AES256; AES uses a different key expansion process when it is given 256 bit keys. If, with AES256, you can determine the entire transform with just one 128 bit round key, that would mean that AES256 encrypts in at most $2^{128}$ different ways, and hence it would effectively have a 128 bit key.
Mar
24
answered How secure is the AES master key if Round Keys are found
Mar
22
comment No of keys used in Triple DES Algorithm
@user2966119: actually, if we look at how 3DES is used in standard protocols (TLS, IPsec), we see that it is treated as if it were a block cipher that takes a single 192 bit key (192, not 168, because standard DES keys are 64 bits, and it doesn't matter to the protocol that some of those key bits are ignored).
Mar
21
reviewed Approve suggested edit on sha-2 tag wiki excerpt
Mar
21
reviewed Approve suggested edit on sha-2 tag wiki
Mar
21
reviewed Edit suggested edit on sha256 tag wiki
Mar
21
revised sha256 wiki description
brief explanation of how SHA-256 fits in the SHA-2 family
Mar
21
reviewed Approve suggested edit on sha512 tag wiki excerpt
Mar
21
reviewed Edit suggested edit on sha512 tag wiki
Mar
21
revised sha512 wiki description
brief explanation of how SHA-512 fits in the SHA-2 family
Mar
21
comment Soundness idea of basic zero knowledge prood
@tylo: yeah, I did replace |G| with n-1, and I ought to have at least noted why. The protocol was written as a MODP group; it wasn't specified that n was prime; however since it assumes the prover knows |G|, that means that the factorization of n is known.
Mar
21
comment Soundness idea of basic zero knowledge prood
Most ZKP's I've seen allow a 0.5 probability per round of accepting a false statement; that is consistent with your "any even challenge to result in acceptance".
Mar
20
revised Proving a decision was randomly made
added 25 characters in body
Mar
20
answered Proving a decision was randomly made
Mar
20
revised Proving a decision was randomly made
edited tags