Hash input
Integrity utility
SHA Hash Generator
Generate SHA-1, SHA-256, SHA-384 and SHA-512 digests from UTF-8 text or local files. Copy HEX or Base64 output and verify common published checksum formats without uploading data.
Web Crypto
Digest details
Hash result summary
Algorithm
Digest bits
Input size
HEX length
Source
Verification
Popular SHA examples
SHA algorithm reference
| Algorithm | Digest size | HEX length | Typical use |
|---|---|---|---|
| SHA-1 | 160 bits | 40 characters | Legacy fingerprints only; avoid for new security-sensitive work |
| SHA-256 | 256 bits | 64 characters | Checksums, integrity checks, package verification and signatures |
| SHA-384 | 384 bits | 96 characters | Longer digest option for modern systems |
| SHA-512 | 512 bits | 128 characters | Long release checksums and high-margin integrity fingerprints |
Hashing notes
Local processingText and files are hashed in the browser with Web Crypto; content is not uploaded.
Deterministic outputThe same bytes and algorithm always produce the same digest.
Encoding mattersText uses UTF-8 bytes; file mode hashes the original file bytes.
Not reversibleSHA hashes are one-way fingerprints and cannot be decoded to the original data.
SHA hash generator FAQ
Should I use SHA-1?
Use SHA-1 only for compatibility with an old system or published legacy checksum. SHA-256 is the practical default for new integrity checks.
Are selected files uploaded?
No. Files are read and hashed locally in your browser. This tool limits files to 256 MB to protect browser memory.
How do I verify a published checksum?
Choose the same algorithm, hash the content, then paste the HEX, Base64, or checksum line into the comparison field.
Is SHA encryption?
No. SHA creates a one-way fingerprint for integrity checks and cannot be decrypted back to the original data.
Handy Tool Lab
How this tool is maintained
Handy Tool Lab builds and tests each tool around repeatable examples. Formula-based tools use published references when a suitable source exists; browser utilities are checked with representative inputs and output cases.