33,624 reputation
12872
bio website
location
age
visits member for 3 years, 5 months
seen 19 mins ago

18h
comment One time pad probability
Actually, your edit is incorrect -- the security of the system holds even if Eve has probabilistic information of $m$ (which, in real world scenarios, she almost always has). The point of OTP is that the ciphertext message doesn't give Eve any information that she didn't already have - it still holds true even if Eve did have some.
20h
reviewed Reviewed Decrypt files with original file CTB-Locker
20h
reviewed No Action Needed Is there a flaw in this ECC blind signature scheme?
20h
reviewed No Action Needed Elliptic Curve based blind signature implementation
20h
answered Do any stream ciphers with aperiodic keystreams exist?
20h
comment One time pad probability
Precisely where in the question were we given the assumption "Alice chooses the message $m$ uniformly..."? I agree that, once we make that assumption (or, at least, that Alice originally chose message $1001001$ with probability $2^{-7}$), we get $2^{-7}$ as a result. However, we weren't told that.
21h
answered Proof that $gcd(e, \lambda(N)) = 1 \hspace{1mm} \Longleftrightarrow \hspace{1mm} gcd(e, \varphi(N)) = 1$
1d
revised One time pad probability
added 208 characters in body
1d
answered One time pad probability
1d
comment Proving the complement property of DES?
Note: the question that I marked this as a duplicate isn't an exact duplicate - however, the answer to that question answers this as well.
1d
comment How hard is it to find plaintexts whose hashes satisfy $h(a)\oplus h(b)=h(c)$?
@RobertNACIRI: yes; the obvious approach is to pick an arbitrary $a$, and then use a birthday attack to find a $b, c$.
1d
comment How hard is it to find plaintexts whose hashes satisfy $h(a)\oplus h(b)=h(c)$?
And it's easy to show that it's at most $O(2^{n/2})$ -- how can we establish where in that range the answer is?
2d
answered Is there a reference that prove that the AES Key Schedule generate random looking round keys?
2d
reviewed No Action Needed How secure is it to use password as AES key?
2d
reviewed No Action Needed Local UC(LUC) : About the impossibility of any simulations which consists hybrid protocols
2d
reviewed Close Achieving 32-bit verification code with 16-bit CRC?
2d
reviewed Close How are calculated numbers in AES S-box?
2d
reviewed Leave Open 1 Billion Bit Encryption?
Jan
29
comment In RSA, why does $p$ have to be bigger than $q$ where $n=p \times q$?
The question was based on behavior seen within OpenSSL; the OpenSSL bignum library handles negative numbers properly, and hence this answer is irrelevant in the context of the original question.
Jan
29
reviewed No Action Needed How do I communicate the value of the initialization vector to the end user? Should it be part of the encrypted message?