65 reputation
5
bio website
location
age
visits member for 2 years, 4 months
seen Jun 9 at 1:17

May
22
awarded  Teacher
Mar
13
comment Division in paillier cryptosystem
yes but like mikeazo pointed out, the answer does not make sense if $b\nmid a$
Mar
13
answered Does RSA work for any message M?
Mar
13
accepted Division in paillier cryptosystem
Mar
12
asked Division in paillier cryptosystem
Mar
9
awarded  Scholar
Mar
9
accepted Shannon entropy calculation: is $H(A|R·A) = H(A)$?
Mar
9
comment Shannon entropy calculation: is $H(A|R·A) = H(A)$?
humm, great insight - but excuse my ignorance of abstract algebra. Why exactly is matrix multiplication a group over invertible matrices?
Mar
8
awarded  Supporter
Mar
8
asked Shannon entropy calculation: is $H(A|R·A) = H(A)$?
Mar
8
revised Security analysis of a matrix multiplication protocol
added 35 characters in body
Mar
7
comment Security analysis of a matrix multiplication protocol
Yes, i edited the question to read mXm, a secure channel means eve does not hear anything. my question really is how much does Bob know about A, given R*A.
Mar
7
awarded  Editor
Mar
7
revised Security analysis of a matrix multiplication protocol
edited mXn to mXm
Mar
7
asked Security analysis of a matrix multiplication protocol
Mar
7
comment Security analysis of a “one-time pad” type hill cipher
humm, yes - but my motivation in asking the question was the following, suppose Alice would like to obtain the product of two matrices A*B. She has A and Bob has B. But she dosen't want Bob to know A, so she multiplies A with a random matrix P and sends P*A. Bob multiplies B to P*A, i.e. P*A*B and sends it to Alice. Alice inverts P to obtain B i.e. (P^-1)*P*A*B. what do you think would be a good way to proceed with the security analysis of this.
Mar
4
awarded  Student
Mar
3
asked Security analysis of a “one-time pad” type hill cipher