⌕ Поиск по атласу

NIST · ИТ · 635462b151099c6dbeab

635462b151099c6dbeab · PRF-Security Revisited With New Efficient Single-Keyed Domain Extensions

PRF-Security Revisited With New Efficient Single-Keyed Domain Extensions

In this paper, we study a wide class of single-keyed domain extension algorithms, called generalized domain extension (\tx{GDE}), extending a keyed function $F_K : {0,1}^b \to {0,1}^n$ to a keyed function $\overline{F}_K : {0,1}^* \to {0,1}^n$, $K \in {0,1

Официальный источник · 2009-08-17

Полные импортированные сведения карточки
{
  "title_en": "PRF-Security Revisited With New Efficient Single-Keyed Domain Extensions",
  "designation": "",
  "series": "",
  "status": "",
  "date": "2009-08-17",
  "date_original": "August 17, 2009",
  "url": "https://www.nist.gov/publications/prf-security-revisited-new-efficient-single-keyed-domain-extensions",
  "source": "NIST Publications",
  "display_en": "",
  "authors_en": "Mridul Nandi",
  "abstract_excerpt_en": "In this paper, we study a wide class of single-keyed domain extension algorithms, called generalized domain extension (\\tx{GDE}), extending a keyed function $F_K : {0,1}^b \\to {0,1}^n$ to a keyed function $\\overline{F}_K : {0,1}^* \\to {0,1}^n$, $K \\in {0,1",
  "id": "635462b151099c6dbeab",
  "sources": [
    "NIST Publications"
  ],
  "source_records": [
    {
      "title_en": "PRF-Security Revisited With New Efficient Single-Keyed Domain Extensions",
      "designation": "",
      "series": "",
      "status": "",
      "date": "2009-08-17",
      "date_original": "August 17, 2009",
      "url": "https://www.nist.gov/publications/prf-security-revisited-new-efficient-single-keyed-domain-extensions",
      "source": "NIST Publications",
      "display_en": "",
      "authors_en": "Mridul Nandi",
      "abstract_excerpt_en": "In this paper, we study a wide class of single-keyed domain extension algorithms, called generalized domain extension (\\tx{GDE}), extending a keyed function $F_K : {0,1}^b \\to {0,1}^n$ to a keyed function $\\overline{F}_K : {0,1}^* \\to {0,1}^n$, $K \\in {0,1"
    }
  ],
  "translation_state": "none"
}