31,922 reputation
12566
bio website
location
age
visits member for 3 years, 3 months
seen 5 hours ago

5h
reviewed No Action Needed How does hash function in Elgamal signature scheme prevent existential forgery attack?
5h
reviewed No Action Needed Addition / Multiplication modulo 13
5h
reviewed No Action Needed Change of axis positions in Vigenere Square
5h
reviewed Reviewed PHP secure random number generator
1d
reviewed Close Bilinear Map vs Inner Product
1d
comment Designing hash function in space-efficient identity based encryption
@hanu: I had assumed that you would generate a random looking value; one way would be to feed the id into a random number generator, generate $\log N + 64$ bits, and then take the result modulo $N$. However, as long as you generate values significantly larger than $\sqrt{N}$, it probably doesn't matter a great deal how you do it (as the squaring process is one-way if you don't know the factorization)
1d
comment Designing hash function in space-efficient identity based encryption
@RickyDemer: well, given that the QR decisional problem is hard if you don't know the factorization, I suspect it might not matter if my method would generate only QR values (because someone else would not be able to distinguish anyways). Of course, that would depend a great deal on why you want values with Jacobi 1 in the first place.
1d
reviewed Reviewed Python. RSA common modulus attack problem
1d
comment Python. RSA common modulus attack problem
There are a couple of problems here (and I don't know Python well enough to give you the answers, hence this comment): a) to compute a 'negative power', you need to compute the modular inverse (and then apply the positive power); Python might provide such a utility, or as fgrieu said, you could do it on your own. b) you are using pow to compute the exponents; that is highly unlikely to work, as ME1^a is going to be huge (perhaps one trillion digits long); instead, you need to compute it modulo N (and again, Python might have a built-it to do that)
1d
reviewed No Action Needed What Java actually stores inside Keystore when generating Keys?
1d
reviewed No Action Needed java.util.Random and Dice Rolls
1d
reviewed No Action Needed CBC-MAC, possible attack that violates computational resistance
1d
reviewed Close Difference between signing with SHA256 vs. signing with RSA-SHA256
1d
reviewed Close Is there a Javascript and Java implementation of a good CSPRNG
1d
reviewed Close Problem description “SAFE”
1d
comment Designing hash function in space-efficient identity based encryption
The obvious (and more efficient) way to come up with a value with a Jacobi of 1 would be to use a hash function to create a value between 1 and $n-1$ (relatively prime to $n$), and then square it (modulo $n$).
1d
revised Hash collision using the leading 40-bits of SHA-1
Math correction
1d
comment Hash collision using the leading 40-bits of SHA-1
@user1813580: why should you expect this logic to find a leading-bit collision within $2^{20}$ iterations; until it falls into a loop, it is effectively doing a random walk through bit patterns; and if you test $2^{20}$ random pairs for 40 bit collisions, you have probability about $2^{-20}$ of finding one. Once you run into a loop, then the bit patterns stop acting randomly (actually, independently), however (as above) you are quite unlikely to run into a loop that early.
2d
answered Hash collision using the leading 40-bits of SHA-1
2d
reviewed No Action Needed Are all binary-additive stream ciphers reciprocal?