Isibali sekhodi sehashi CRC-32

Kushicilelwe: Februwari 17, 2025 18:39:03 UTC
Igcine ukubuyekezwa: Januwari 12, 2026 11:37:00 UTC

Isibali sekhodi ye-hash esisebenzisa umsebenzi we-hash we-CRC-32B (Cyclic Redundancy Check 32 bit, B variant) ukuze kubalwe ikhodi ye-hash ngokusekelwe kokufakwa kombhalo noma ukulayishwa kwefayela.

Leli khasi lihunyushwe ngomshini lisuka esiNgisini ukuze lenze lifinyeleleke kubantu abaningi ngangokunokwenzeka. Ngeshwa, ukuhumusha ngomshini akukabi ubuchwepheshe obuphelele, ngakho-ke amaphutha angenzeka. Uma uthanda, ungabuka inguqulo yokuqala yesiNgisi lapha:

CRC-32B Hash Code Calculator

I-Cyclic Redundancy Check (CRC) ikhodi yokuthola amaphutha evame ukusetshenziswa ukuthola izinguquko ngengozi kudatha eluhlaza. Nakuba ingeyona umsebenzi we-cryptographic hash, i-CRC-32 ivame ukubizwa ngokuthi i-hash ngenxa yekhono layo lokukhiqiza umphumela wosayizi ohleliwe (ama-bits angu-32) kusuka kokufakwayo kobude obuguquguqukayo. Inguqulo eyethulwe kuleli khasi iyi-variant ye-CRC-32B, okuyisimo nje esingavamile olimini lwe-PHP esiguqula ama-bits (i-little-endian vs i-big-endian ku-CRC-32 yokuqala).

Ukudalulwa okuphelele: Angibhalanga ukusetshenziswa okuqondile komsebenzi we-hashi osetshenziswe kuleli khasi. Kungumsebenzi ojwayelekile ofakwe nolimi lokuhlela lwe-PHP. Ngenze isixhumi esibonakalayo sewebhu kuphela ukuze ngisenze sitholakale esidlangalaleni lapha ukuze kube lula.

Mayelana ne-CRC-32B Hash Algorithm

Angisiye isazi sezibalo, kodwa ngizozama ukuchaza lo msebenzi we-hash ngesifaniso esilula. Ngokungafani nemisebenzi eminingi ye-cryptographic hash, akuyona i-algorithm eyinkimbinkimbi kakhulu, ngakho cishe kuzolunga ;-)

Cabanga uthumela incwadi ngeposi, kodwa ukhathazekile ukuthi ingase yonakale ngaphambi kokuba ifike kumamukeli. Ngokusekelwe kokuqukethwe kwencwadi, ubala i-CRC-32 checksum bese uyibhala emvilophini. Uma umamukeli ethola incwadi, angakwazi futhi ukubala i-checksum bese ebona ukuthi iyahambisana yini nalokho okubhalile. Uma kunjalo, incwadi ayizange yonakale noma ishintshwe endleleni.

Indlela i-CRC-32 ekwenza ngayo lokhu iyinqubo enezinyathelo ezine:

Isinyathelo 1: Engeza Isikhala Esengeziwe (Ukugcwalisa)

I-CRC yengeza isikhala esincane esengeziwe ekugcineni komyalezo (njengokupakisha amantongomane ebhokisini).
Lokhu kukusiza ukuthi ubone amaphutha kalula.

Isinyathelo 2: Umbusi Womlingo (I-Polynomial)

I-CRC-32 isebenzisa "umbusi womlingo" okhethekile ukukala idatha. Cabanga ngalo mbusi njengephethini yamaqhubu nemifantu (leli yi-polynomial, kodwa ungakhathazeki ngalelo gama). "Umbusi" ovame kakhulu we-CRC-32 iphethini ezinzile.

Isinyathelo 3: Ukushelela Umlawuli (Inqubo Yokuhlukanisa)

Manje i-CRC ishelela irula phezu komyalezo. Endaweni ngayinye, ihlola ukuthi amaqhubu kanye nemisele kuyahambisana yini. Uma kungahambelani, i-CRC ibhala inothi (lokhu kwenziwa kusetshenziswa i-XOR elula, njengokuvula noma ukuvala amaswishi). Iqhubeka ishelela futhi ishintsha amaswishi ize ifike ekugcineni.

Isinyathelo 4: Umphumela Wokugcina (I-Checksum)

Ngemva kokuslayida irula kuwo wonke umlayezo, usala nenombolo encane (amabhithi angu-32 ubude) emele idatha yokuqala. Le nombolo ifana nomunwe oyingqayizivele womlayezo. Lena yi-CRC-32 checksum.

Inguqulo eyethulwe ekhasini uhlobo lwe-CRC-32B, oluvame ukuba yi-PHP quirk eshintsha i-bit order (little-endian vs big-endian). Cishe kufanele usebenzise le nguqulo kuphela uma udinga ukuhambisana nolunye uhlelo lokusebenza lwe-PHP oluyisebenzisayo.

Nginazo izibali zezinye izinhlobo futhi:

Isixhumanisi
Isixhumanisi

Ukufunda Okuqhubekayo