Кодові криптосистеми для постквантового застосування
Code-based public-key cryptosystems based on algebraic coding are considered. They are based on masking algebraic block codes with fast decoding algorithm (polynomial complexity) at random linear block code with NP-hard decoding. Assessment the strength is offered, including quantum cryptanalysis, a...
Збережено в:
| Дата: | 2017 |
|---|---|
| Автори: | , , |
| Формат: | Стаття |
| Мова: | Ukrainian |
| Опубліковано: |
Kamianets-Podilskyi National Ivan Ohiienko University
2017
|
| Онлайн доступ: | http://mcm-tech.kpnu.edu.ua/article/view/112019 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Mathematical and computer modelling. Series: Technical sciences |
Репозитарії
Mathematical and computer modelling. Series: Technical sciences| Резюме: | Code-based public-key cryptosystems based on algebraic coding are considered. They are based on masking algebraic block codes with fast decoding algorithm (polynomial complexity) at random linear block code with NP-hard decoding. Assessment the strength is offered, including quantum cryptanalysis, and evaluating performance in comparison with the known cryptosystems. |
|---|