Unit Instance

HTTP 200 OK
Allow: GET, PUT, PATCH, DELETE, HEAD, OPTIONS
Content-Type: application/json
Vary: Accept

{
    "translation": "https://weblate.info.ucl.ac.be/api/translations/cnp3-ebook/principlessecurity/en/?format=api",
    "source": [
        "To efficiently sign messages, Alice needs to be able to compute a summary of her message in a way that makes prohibits an attacker from generating a different message that has the same summary. `Cryptographic hash functions` were designed to solve this problem. The ideal hash function is a function that returns a different number for every possible input. In practice, it is impossible to find such a function. Cryptographic hash functions are an approximation of this perfect summarization function. They compute a summary of a given message in 128, 160, 256 bits or more. They also exhibit the `avalanche effect`. This effect indicates that a small change in the message causes a large change in the hash value. Finally hash functions are very difficult to invert. Knowing a hash value, it is computationally very difficult to find the corresponding input message. Several hash functions have been proposed by cryptographers. The most popular ones are :"
    ],
    "previous_source": "",
    "target": [
        "To efficiently sign messages, Alice needs to be able to compute a summary of her message in a way that makes prohibits an attacker from generating a different message that has the same summary. `Cryptographic hash functions` were designed to solve this problem. The ideal hash function is a function that returns a different number for every possible input. In practice, it is impossible to find such a function. Cryptographic hash functions are an approximation of this perfect summarization function. They compute a summary of a given message in 128, 160, 256 bits or more. They also exhibit the `avalanche effect`. This effect indicates that a small change in the message causes a large change in the hash value. Finally hash functions are very difficult to invert. Knowing a hash value, it is computationally very difficult to find the corresponding input message. Several hash functions have been proposed by cryptographers. The most popular ones are :"
    ],
    "id_hash": -3393238480826350054,
    "content_hash": -3393238480826350054,
    "location": "../../principles/security.rst:433",
    "context": "",
    "note": "",
    "flags": "",
    "state": 100,
    "fuzzy": false,
    "translated": true,
    "approved": false,
    "position": 43,
    "has_suggestion": false,
    "has_comment": false,
    "has_failing_check": false,
    "num_words": 156,
    "source_unit": "https://weblate.info.ucl.ac.be/api/units/35292/?format=api",
    "priority": 100,
    "id": 35292,
    "web_url": "https://weblate.info.ucl.ac.be/translate/cnp3-ebook/principlessecurity/en/?checksum=50e8cb947028c61a",
    "url": "https://weblate.info.ucl.ac.be/api/units/35292/?format=api",
    "explanation": "",
    "extra_flags": "",
    "pending": false,
    "timestamp": "2021-08-27T14:43:07.690434+02:00"
}