966a33ce84f08a027ece · How Random is Your RNG?

{
  "title_en": "How Random is Your RNG?",
  "designation": "",
  "series": "",
  "status": "",
  "date": "2015-01-18",
  "date_original": "January 18, 2015",
  "url": "https://www.nist.gov/publications/how-random-your-rng",
  "source": "NIST Publications",
  "display_en": "",
  "authors_en": "Meltem Sonmez Turan , John M. Kelsey , Kerry A. McKay",
  "abstract_excerpt_en": "Cryptographic primitives need random numbers to protect your data. Random numbers are used for generating secret keys, nonces, random paddings, initialization vectors, salts, etc. Deterministic pseudorandom number generators are useful, but they still need",
  "id": "966a33ce84f08a027ece",
  "sources": [
    "NIST Publications"
  ],
  "source_records": [
    {
      "title_en": "How Random is Your RNG?",
      "designation": "",
      "series": "",
      "status": "",
      "date": "2015-01-18",
      "date_original": "January 18, 2015",
      "url": "https://www.nist.gov/publications/how-random-your-rng",
      "source": "NIST Publications",
      "display_en": "",
      "authors_en": "Meltem Sonmez Turan , John M. Kelsey , Kerry A. McKay",
      "abstract_excerpt_en": "Cryptographic primitives need random numbers to protect your data. Random numbers are used for generating secret keys, nonces, random paddings, initialization vectors, salts, etc. Deterministic pseudorandom number generators are useful, but they still need"
    }
  ],
  "translation_state": "none",
  "possible_title_matches": 1
}