For an unknown 16 bit number U
, an N
(8 bit) modulo operation can applied, which results in a known 8 bit number R
. The value N
must be: 128 >= N >= 255
. How do I find U
, or at least as much as I can?
The first 7 bytes can be obtained by U mod (2^7) => U AND (2^7)
.
I thought about doing the same trick with ternary base and find the overlaps. but 5 trit (tribary bits) number can overflow the 8 bit result.
Is there some known trick for that?