Аналіз складності реалізацій криптосистем на групах
This paper presents comparative analysis of cryptographic realyzations on groups. It is shown that the construction of cryptosystems in groups requires efficient algorithm for the mapping of number to the group and feedback mapping with computationally simple operation group. To date, there is only...
Збережено в:
| Видавець: | Kamianets-Podilskyi National Ivan Ohiienko University |
|---|---|
| Дата: | 2016 |
| Автор: | |
| Формат: | Стаття |
| Мова: | Ukrainian |
| Опубліковано: |
Kamianets-Podilskyi National Ivan Ohiienko University
2016
|
| Онлайн доступ: | http://mcm-tech.kpnu.edu.ua/article/view/112069 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Репозиторії
Mathematical and computer modelling. Series: Technical sciences| Резюме: | This paper presents comparative analysis of cryptographic realyzations on groups. It is shown that the construction of cryptosystems in groups requires efficient algorithm for the mapping of number to the group and feedback mapping with computationally simple operation group. To date, there is only one known implementation of a cryptosystem MST3, built on the base of the abelian center of Suzuki group. |
|---|