About Keccak Hash Generator
The Keccak hash algorithm was designed by Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche, building upon RadioGatún. It was selected as the winner of the SHA-3 design competition. This version of the algorithm is Keccak[c=2d] and differs from the SHA-3 specification.
Input: binary bytes (text input uses UTF-8; a file retains its original bytes). Output: text.
Format reference: Keccak background and specification
Example
Use “Try example” to load this public sample and its settings, then run it.
Settings used in this example
| Parameter | Example value | Input and choices |
|---|---|---|
| Size | 224 | 512, 384, 256, 224 |
Input
Hello, World!
Result
4eaaf0e7a1e400efba71130722e1cb4d59b32afb400e654afec4f8ce
Parameters
| Parameter | Default value | Input and choices |
|---|---|---|
| Size | 512 | 512, 384, 256, 224 |
Before interpreting the result
Use a checksum to compare exact bytes against a trusted digest. Choose a password hashing function for passwords and a MAC for keyed authentication. MD5 and SHA-1 are unsuitable for new security-sensitive designs.
How to use this page
- Paste your input or open a local file.
- Adjust tool options if needed, then choose Run tool.
- Copy the result or download the original output bytes.
Inputs and results are not added to the public catalogue or saved in the URL. Processing happens in your browser; HTTP Request and DNS over HTTPS send the requests you explicitly run. Files up to 128 MiB can be opened; decompression and image tools may have smaller processing limits. Large results have a shortened preview. Text and HTML downloads use UTF-8; binary downloads preserve output bytes. Pasted text follows browser newline handling; open a file when exact input bytes matter.