Is it possible to solve this bitwise equation? I have been googling but I can't get a conclusion. I have this equation:
a = ((b ^ x) >> c) & d | e * ((b ^ x) & f)

Would it be possible to solve this bitwise equation? Assuming all values are known except x.
Thank you in advance.

If anyone is interested in the answer, finally I solved it with the help of bruteforce.
First, I concluded that the result of ((b ^ x) >> c) & d was always relatively low (in a range of 0-50) and most of times 0 or 1 so I transformed the equation into this:
a = y | e * ((b ^ x) & f)

And defined the value of y with a loop that increases y progresively from 0.
Then I setted up another loop that defines the value of x and then checked for each value if the equality is met.
Since I was getting a lot of false positives, I decided to check if current value of y is correct. Now I know x, so:
((b ^ x) >> c) & d = y

If the equality is met I have found a solution, if not the loop continues until find a valid solution.
Sometimes I get duplicated solutions. For example, in one case I got two solutions: 7957 and 73493. Curiously, that numbers translated to hexadecimal are: 1F15 and 11F15. And in most of cases duplicated solutions follow that rule.
