Look up the fixed digest bit lengths of supported SHA-family algorithms. Use it when the input measurements and conventions below match the operation you need.

• Prepare algorithm, respecting the measurement basis and boundaries below.
• Compare the worked example with your intended operation before reusing its result.

1. Enter every field in the input table using the stated units and exact supported selector spelling where applicable.
2. Run the tool. Correct input errors before interpreting an output.
3. Read the result fields below; use accompanying flags and the stated sign, boundary or model convention when interpreting a number.

Choose an exact algorithm label from the supported mapping. The tool returns its stored output-bit reference; an unknown or differently spelled selector is rejected.^[1]

• No digest is computed and no security recommendation follows from the bit length alone. Extendable-output algorithms and unlisted variants are not inferred.
• Every declared field is required and unexpected fields are rejected. Numeric inputs must be finite; input errors are distinct from a valid false result or an explicitly qualified output.
• Extremely large inputs and nonfinite or excessively large outputs are rejected. List positions reported by the tool use zero-based indices unless stated otherwise.

Use the applicable protocol specification and a reviewed implementation for real verification, hashing or key management. A format label, probability model or tentative text mapping does not replace that operation. Compare the scope of the nearby tools below before substituting one.

• acrostic first letter extractor

  An acrostic forms a sequence from the first character of successive words.

• adfgvx cipher

  ADFGVX uses a six-by-six symbol square before keyed column transposition.