An estimation of efficiency of algorithms of cryptographic compression of built is on basis of tree of Shterna - Broko
The quantitative indexes of estimation of sentinel and capacity complication of algorithms of enciphering, decodings which are built as algorithms of cryptographic compression on the basis of tree (scales of notation) of Shterna-Broko are considered.Problems in programming 2009; 4: 71-76
Збережено в:
| Дата: | 2026 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | Українська |
| Опубліковано: |
PROBLEMS IN PROGRAMMING
2026
|
| Теми: | |
| Онлайн доступ: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/982 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Problems in programming |
| Завантажити файл: |  |
Репозитарії
Problems in programming| Резюме: | The quantitative indexes of estimation of sentinel and capacity complication of algorithms of enciphering, decodings which are built as algorithms of cryptographic compression on the basis of tree (scales of notation) of Shterna-Broko are considered.Problems in programming 2009; 4: 71-76 |
|---|