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 (N log N) and a space complexity of O (N), where N N is the order of the group. (If N N is unknown, a simple modifi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter Open Ltd
2022
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |