🔐 Ġeneratur tal-Hash

Iġġenera hashes MD5, SHA-1, SHA-256 u SHA-512 istantanjament fil-browser tiegħek.

X'inhuma l-funzjonijiet tal-hash kriptografiku?

Funkzjoni ta' hash kriptografiku hija algoritmu matematiku li jibdel data ta' daqs varjabbli f'sekwenza ta' karattri ta' daqs stabbilit. Hija funzjoni f'direzzjoni waħda.

Algoritmi Appoġġjati

  • MD5 (128-bit): Mgħaġġel, iżda meqjus mhux sigur. Użat l-aktar biex jivverifika l-integrità tal-fajls (checksums). Fast but considered insecure for cryptographic purposes. Still used for checksums.
  • SHA-1 (160-bit): Algoritmu skadut. Mhux irrakkomandat għas-sigurtà, għalkemm għadu jintuża f'sistemi bħal Git. Deprecated for security. Vulnerable to collision attacks since 2017.
  • SHA-256 (256-bit): L-istandard tal-industrija. Jintuża fiċ-ċertifikati SSL/TLS u f'firem diġitali. Part of SHA-2 family. Widely used in SSL, Bitcoin, and modern security.
  • SHA-512 (512-bit): Sigurtà massima. Irrakkomandat ħafna għall-ħabi ta' passwords. Strongest common hash. Used in high-security applications.

Mistoqsijiet Frekwenti (FAQ)

Huwa l-MD5 għadu sigur biex jintuża?

Le, l-MD5 ġie miksur kriptografikament. Użah biss għal għanijiet mhux ta' sigurtà. Għas-sigurtà uża SHA-256 jew SHA-512.

Huwa possibbli li treġġa' lura (decrypt) is-sinjal tal-hash?

Le. Il-funzjonijiet tal-hash huma f'direzzjoni waħda. Madankollu, passwords dgħajfa jistgħu jinqatgħu bl-għajnuna ta' rainbow tables. Dejjem uża 'salt' għall-passwords.

Creates cryptographic hash values (MD5, SHA-1, SHA-256, SHA-512) for data integrity verification, password storage, and digital signatures.

Key Facts

  • SHA-256 produces 64 hex character hash
  • MD5 collision attacks demonstrated in 2004
  • Bitcoin uses double SHA-256
  • Single bit change completely changes output (avalanche effect)

Frequently Asked Questions

Which hash algorithm to use?

SHA-256 for general purpose. MD5/SHA-1 broken for security. For passwords use bcrypt/Argon2.

Is MD5 still safe?

Not for security (collisions found 2004). OK for checksums and cache keys where collision resistance not critical.

What is a hash collision?

Two different inputs producing same hash. Should be computationally infeasible for secure algorithms.

What is a hash function?

One-way algorithm converting any input to fixed-length string. Same input always produces same hash, irreversible.