SHA-3
SHA-3 is a NIST-standardized family of cryptographic hash functions based on the Keccak sponge construction and providing multiple fixed-length output sizes.
Software Security for Developers
SHA-3 is a family of cryptographic hash algorithms standardized with multiple output sizes including 224, 256, 384, and 512 bits.
- How it is used
- Uses SHA-3 to detect file corruption and validate message contents in Java services.
- How deep it goes
- Explains fixed-size deterministic hashes and demonstrates Java file hashing, while avoiding mathematical or algorithmic internals.
- Examples
- Demonstrates hashing refunds.json, comparing a supplied digest at an endpoint, and rejecting modified refund data.
- What you can do after
- Apply it via Java MessageDigest to calculate and compare SHA3-256 file digests.
Real-World Cryptography
SHA-3 is a standardized family of cryptographic hash functions based on the Keccak sponge construction.
- How it is used
- Positions SHA-3 as the recommended standardized hash function when length-extension resistance and secret hashing matter.
- How deep it goes
- Explains permutations, rate, capacity, absorption, and squeezing at a high level while deferring keccak-f internals.
- Examples
- Uses permutation diagrams, rate-and-capacity diagrams, XOR absorption examples, and SHA-3 output variants.
- What you can do after
- Evaluate SHA-3 variants and understand how sponge absorption and squeezing produce a digest.
Hacking Cryptography
SHA-3 is a standardized family of cryptographic hash algorithms based on a sponge construction.
- How it is used
- Explains SHA-3 as a modern hash design and contrasts its sponge interface with older Merkle–Damgård hashes.
- How deep it goes
- Explains absorption, squeezing, rate, capacity, and collision-resistance calculations, but does not provide implementation code.
- Examples
- Compares SHA3-224 through SHA3-512 and SHAKE128/256 using output, rate, capacity, and collision-resistance parameters.
- What you can do after
- Evaluate hash constructions by tracing sponge phases, rate-capacity parameters, and exposure to length-extension attacks.
Related concepts
- sponge constructionimplements · A sponge construction absorbs input into a state through repeated permutation applications and squeezes output from that state, supporting outputs of arbitrary length.
- hash functionkind of · A hash function deterministically maps input data to a value in a bounded output range, commonly for indexing, lookup, comparison, or integrity checking.
- cryptographic hashkind of · A cryptographic hash is a fixed-length digest computed from input data by a deterministic function designed to resist preimage, second-preimage, and collision attacks.
- cryptographic algorithmkind of · A cryptographic algorithm is a mathematical procedure that transforms data or generates cryptographic values to provide security properties such as confidentiality, integrity, or authentication.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.