My question is fairly simple.
Given equation:
r = ( a + b + c ) mod m
Where m = 2^32, and values r and a are known values.
Assuming:
Edit:
b + c < m
Is it possible to calculate a specific value of b and c? I've been digging into the Euclidean Algorithm/CRT, but haven't found any relation of this form that would be useful. I can pretty easily calculate the value of b + c, but I fear I'm looking at a brick wall.
Any and all help/suggestions for further reading would greatly appreciated. Cheers!