| ??? 05/28/09 12:35 Read: times |
#165673 - Everything on Google Responding to: ???'s previous message |
Google for CRC.
If you play with xor, then you shift in one bit at a time of your byte, so you perform 8 16-bit wide steps for each byte. You can also precompute a table to avoid having to process the data one bit at a time. You may process it 2 bits at a time, 4 bits at a time, 8 bits at a time. Above 8 bits/iteration, the size of the table will be very large. But all this is available on the net. The code is available. The description of the algorithm is available. Pre-built tables are available. Code that builds the tables are available. Just one thing - use a PC and not a 8051 while trying to figure out if this specific unit - that you still haven't mentioned brand/model for - is using a 16-bit CRC. |
| Topic | Author | Date |
| UART encryption algorithm | 01/01/70 00:00 | |
| Do you really mean "encryption"? | 01/01/70 00:00 | |
| Adler-32 alwas an alternative | 01/01/70 00:00 | |
| xmodem? | 01/01/70 00:00 | |
| Nothing magic | 01/01/70 00:00 | |
| Series of mathematical routine. | 01/01/70 00:00 | |
| PSX Memory card in example... | 01/01/70 00:00 | |
| Just CRC | 01/01/70 00:00 | |
| CRC encrypt? | 01/01/70 00:00 | |
| Describe your problem - not how you think of solving it | 01/01/70 00:00 | |
| why weak? --my problem | 01/01/70 00:00 | |
| More on CRC | 01/01/70 00:00 | |
| Yes thats it(i missed YOUR POST) | 01/01/70 00:00 | |
| Few 16-bit CRC combinations | 01/01/70 00:00 | |
| 16 combination? | 01/01/70 00:00 | |
| Everything on Google | 01/01/70 00:00 | |
| You forgot some | 01/01/70 00:00 | |
Most, not all | 01/01/70 00:00 | |
| Are you trying to copy an existing protocol? | 01/01/70 00:00 | |
| yes Black box | 01/01/70 00:00 | |
| You really should have said that in the first place! | 01/01/70 00:00 | |
| CRC with in different colors? | 01/01/70 00:00 | |
| pls explain | 01/01/70 00:00 |