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

IETF · RFC · RFC6210

RFC6210 · Experiment: Hash Functions with Parameters in the Cryptographic Message Syntax (CMS) and S/MIME

Experiment: Hash Functions with Parameters in the Cryptographic Message Syntax (CMS) and S/MIME

New hash algorithms are being developed that may include parameters. Cryptographic Message Syntax (CMS) has not currently defined any hash algorithms with parameters, but anecdotal evidence suggests that defining one could cause major problems. This document defines just such an algorithm and describes how to use it so that experiments can be run to find out how bad including hash parameters will be. This document defines an Experimental Protocol for the Internet community.

Официальная английская аннотация

New hash algorithms are being developed that may include parameters. Cryptographic Message Syntax (CMS) has not currently defined any hash algorithms with parameters, but anecdotal evidence suggests that defining one could cause major problems. This document defines just such an algorithm and describes how to use it so that experiments can be run to find out how bad including hash parameters will be. This document defines an Experimental Protocol for the Internet community.

Связи документа

Официальный источник · 2011-04-01

Полные импортированные сведения карточки
{
  "id": "RFC6210",
  "number": 6210,
  "title_en": "Experiment: Hash Functions with Parameters in the Cryptographic Message Syntax (CMS) and S/MIME",
  "title_ru": "",
  "summary_ru": "",
  "purpose_ru": "",
  "use_ru": "",
  "full_translation_path": "",
  "full_translation_checked_at": "",
  "full_translation_source_sha256": "",
  "architect_note_ru": "",
  "topics_ru": [],
  "translation_state": "not_prepared",
  "verification_level": "not_prepared",
  "verification_level_ru": "Русская выжимка не подготовлена",
  "verification_note_ru": "",
  "abstract_en": "New hash algorithms are being developed that may include parameters. Cryptographic Message Syntax (CMS) has not currently defined any hash algorithms with parameters, but anecdotal evidence suggests that defining one could cause major problems. This document defines just such an algorithm and describes how to use it so that experiments can be run to find out how bad including hash parameters will be. This document defines an Experimental Protocol for the Internet community.",
  "authors": [
    "J. Schaad"
  ],
  "organizations": [],
  "publication_date": "2011-04-01",
  "current_status": "EXPERIMENTAL",
  "current_status_ru": "Экспериментальный",
  "publication_status": "EXPERIMENTAL",
  "publication_status_ru": "Экспериментальный",
  "lifecycle": "experimental",
  "lifecycle_ru": "Экспериментальный",
  "stream": "IETF",
  "stream_ru": "IETF",
  "area": "",
  "area_ru": "",
  "working_group": "NON WORKING GROUP",
  "source_draft": "draft-schaad-smime-hash-experiment-06",
  "page_count": 14,
  "doi": "10.17487/RFC6210",
  "keywords": [
    "example",
    "MD5-XOR",
    "Parameterized"
  ],
  "formats": [
    "TXT",
    "HTML"
  ],
  "relations": {
    "obsoletes": [],
    "obsoleted_by": [],
    "updates": [],
    "updated_by": [],
    "is_also": [],
    "see_also": []
  },
  "links": {
    "info": "https://www.rfc-editor.org/info/rfc6210/",
    "html": "https://www.rfc-editor.org/rfc/rfc6210.html",
    "txt": "https://www.rfc-editor.org/rfc/rfc6210.txt",
    "datatracker": "https://datatracker.ietf.org/doc/rfc6210/"
  }
}