Re: CRC question
- From: "Joe" <josephreuter@xxxxxxxxx>
- Date: 22 Aug 2006 13:16:12 -0700
Tom wrote:
"hypermodest" <hypermodest@xxxxxxxxx> wrote in message
news:1156274464.334380.62710@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Tom wrote:
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?
My task is much complex then I wrote in my post, anyway.. I have a
source code of very special hash-function and I seek ways to crack it
somehow. One part of this function is CRC-function where polynomial may
be different.
I think I'll need to write more.
most of the 32bit polynomials are not prime, composed of factors, which
causes difficulty, data dependent errors.
You can find a list of all the prime 32bit polys in some older books.
Error Correcting Codes by Peterson and Weldon is in stock at
Amazon.com.
Joseph Reuter
--------------
I'm confused...wait a minute -- maybe I'm not!
.
- References:
- CRC question
- From: hypermodest
- Re: CRC question
- From: Tom
- Re: CRC question
- From: hypermodest
- Re: CRC question
- From: Tom
- CRC question
- Prev by Date: Re: CRC question
- Next by Date: Re: Ciphers and their effect on the size of data
- Previous by thread: Re: CRC question
- Next by thread: Re: CRC question
- Index(es):