Re: CRC question

A CRC codeword (when interpreted as a polynomial) is a multiple of the
generator polynomial. So we are looking for common divisors. The
Euclidean algorithm
might help here.
Cheers
gaz

hypermodest wrote:
Hello.
We have CRC32 function with data and polynomial as arguments which is
returning CRC value (remainder).
All arguments are 32-bit values, so our data is always 4 byte.
We know input data and result and we need to determine polynomial value
which is was used but we cannot use brute-force attack because it's
slow.
What can we do?
Thanks in advance. Sorry if this question is dumb and boring.

.