14,445 reputation
22066
bio website pwnhome.wordpress.com
location
age
visits member for 2 years, 11 months
seen 2 hours ago

I like crypto. Need I say more?


Dec
5
comment Get RSA PlainText without Knowing Private Key
@aligajani you call rsa_crack with a different ciphertext each time. Where the new ciphertext was obtained by multiplying by $i^e$
Dec
5
comment Get RSA PlainText without Knowing Private Key
@AliGajani you say why isn't c2 written as c2=.m^e mod n. What is m? In writing c2 the way I did I simply wanted to show that given a ciphertext you could compute another ciphertext with is related to the original in a predictable manner. In this case it was a multiply by 2. It could have been multiply by m too and that would have been fine.
Dec
5
comment Get RSA PlainText without Knowing Private Key
@AliGajani the output of RSA-Crack() would be $m_1\cdot i$. So to get $m_1$, you'd have to divide by $i$. Remember the goal is to get $m_1$ from a function which works with 0.01 probability.
Dec
5
comment How hard is to invert the function that computes the middle-bits of (x^2)?
cleaned up some comments that were no longer needed
Dec
5
revised How hard is to invert the function that computes the middle-bits of (x^2)?
deleted 1435 characters in body
Dec
4
reviewed Approve suggested edit on Is a simple stream cipher “partially homomorphic” if no integrity check is applied?
Dec
4
revised How hard is to invert the function that computes the middle-bits of (x^2)?
added 307 characters in body
Dec
4
revised How hard is to invert the function that computes the middle-bits of (x^2)?
deleted 9 characters in body
Dec
4
comment Is a simple stream cipher “partially homomorphic” if no integrity check is applied?
@Polynomial Most homomorphic ciphers allow you to add and/or multiply in plaintext values (in addition to ciphertext values). I just believe that to be called a homomorphic cipher it should securely be able to combine ciphertexts.
Dec
4
comment Is a simple stream cipher “partially homomorphic” if no integrity check is applied?
@poncho, not sure, but I sure don't want to use software that spits out multiple ciphertexts encrypted with the same keystream (whether it spits out 2 or 3 or more).
Dec
4
answered Is a simple stream cipher “partially homomorphic” if no integrity check is applied?
Dec
4
revised How hard is to invert the function that computes the middle-bits of (x^2)?
added 87 characters in body
Dec
4
revised How hard is to invert the function that computes the middle-bits of (x^2)?
deleted 67 characters in body
Dec
4
revised How hard is to invert the function that computes the middle-bits of (x^2)?
deleted 67 characters in body
Dec
4
answered How hard is to invert the function that computes the middle-bits of (x^2)?
Dec
4
revised How hard is to invert the function that computes the middle-bits of (x^2)?
added 2 characters in body
Dec
3
reviewed Approve suggested edit on Is the composition of collision resistant hash with non collision resistant hash a collision resistant hash?
Dec
2
comment What does this step in this protocol for the Yao's Millionaire Problem mean?
1-2 does not mean 1 out of 2 bits it means 1 item out of a set of two items. The items can be any length.
Nov
30
awarded  Enlightened
Nov
28
revised Can homomorphic encryption filter?
added 34 characters in body