A deterministic algorithm for the discrete logarithm problem in a semigroup
The discrete logarithm problem (DLP) in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have a time complexity of O(NlogN)O\left(\sqrt{N}\log N) and a space complexity of O(N)O\left(\sqrt{N}), where NN is the order of the group. (I...
Сохранить в:
| Главные авторы: | , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
De Gruyter
2022-07-01
|
| Серии: | Journal of Mathematical Cryptology |
| Предметы: | |
| Online-ссылка: | https://doi.org/10.1515/jmc-2021-0022 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|