Re: CRC question
- From: "Tom" <Tommike@xxxxxxxxxxxxxxxxxxxx>
- Date: Tue, 22 Aug 2006 14:09:41 -0500
"hypermodest" <hypermodest@xxxxxxxxx> wrote in message
news:1156265512.703625.194350@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
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.
there are a fixed number of CRC's that are 32 bits long that are prime.
the one used called "CRC32" is just the first one on the list.
how do you know you have decoded data anyway? you read text?
.
- Follow-Ups:
- Re: CRC question
- From: hypermodest
- Re: CRC question
- References:
- CRC question
- From: hypermodest
- CRC question
- Prev by Date: Re: Ciphers and their effect on the size of data
- Next by Date: Re: CRC question
- Previous by thread: Re: CRC question
- Next by thread: Re: CRC question
- Index(es):