Latest revision as of 00:24, 20 January 2026

SHA-1

A hash algorithm with the property that it is computationally infeasible 1) to find a message that corresponds to a given message digest, or 2) to find two different messages that produce the same message digest.

Source: CNSSI 4009-2015 | Category:

Revision as of 01:42, 15 January 2026 view source imported>Unknown user No edit summary ← Older edit		Latest revision as of 00:24, 20 January 2026 view source imported>Unknown user No edit summary
(One intermediate revision by the same user not shown)
(No difference)