mirror of
https://codeberg.org/openpgp/notes.git
synced 2024-11-22 23:52:05 +01:00
parent
40924bef0d
commit
d33c8d7933
1 changed files with 3 additions and 3 deletions
|
@ -8,12 +8,12 @@ SPDX-License-Identifier: CC-BY-SA-4.0
|
|||
|
||||
## Cryptographic hash functions
|
||||
|
||||
[Cryptographic hash functions](https://en.wikipedia.org/wiki/Cryptographic_hash_function) take data strings of any length (like a text message or file) and output a fixed-size code, often called a "hash" or "digest." This hash acts like a unique identifier for the original data.
|
||||
[Cryptographic hash functions](https://en.wikipedia.org/wiki/Cryptographic_hash_function) take data strings of any length (like a text message or file) and output a fixed-size code, a "hash digest". Often abbreviated as either "digest" or "hash." A hash digest acts like a unique identifier for the original data.
|
||||
|
||||
Here are two important properties of cryptographic hash functions:
|
||||
|
||||
- ["Pre-image resistance"](https://en.wikipedia.org/wiki/Preimage_attack): Given a hash value, it should be very difficult to determine the original data it represents.
|
||||
- ["Collision resistance"](https://en.wikipedia.org/wiki/Collision_resistance): It should be very difficult to find two distinct pieces of data that map to the same hash value.
|
||||
- ["Pre-image resistance"](https://en.wikipedia.org/wiki/Preimage_attack): Given a hash digest, it should be very difficult to determine the original data it represents.
|
||||
- ["Collision resistance"](https://en.wikipedia.org/wiki/Collision_resistance): It should be very difficult to find two distinct pieces of data that map to the same hash digest.
|
||||
|
||||
## Message authentication codes
|
||||
|
||||
|
|
Loading…
Reference in a new issue