Publication: A deterministic algorithm for the discrete logarithm problem in a semigroup
A deterministic algorithm for the discrete logarithm problem in a semigroup
Date
Date
Date
Citations
Tinani, S., & Rosenthal, J. (2022). A deterministic algorithm for the discrete logarithm problem in a semigroup. Journal of Mathematical Cryptology, 16, 141–155. https://doi.org/10.1515/jmc-2021-0022
Abstract
Abstract
Abstract
The discrete logarithm problem (DLP) in a finite group is the basis for many protocols in crypto-graphy. The best general algorithms which solve this problem have a time complexity of O(root N logN) and a space complexity of O(root N), where N is the order of the group. (If N is unknown, a simple modification would achieve a time complexity of (root N(logN)(2)).) These algorithms require the inversion of some group elements or rely on finding collisions and the existence of inverses, and thus do not adapt to work in the general semigr
Additional indexing
Creators (Authors)
- Tinani, Simran
Volume
Volume
Volume
Number
Number
Number
Page range/Item number
Page range/Item number
Page range/Item number
Page end
Page end
Page end
Item Type
Item Type
Item Type
In collections
Keywords
Language
Language
Language
Publication date
Publication date
Publication date
Date available
Date available
Date available
ISSN or e-ISSN
ISSN or e-ISSN
ISSN or e-ISSN
Additional Information
Additional Information
Additional Information
OA Status
OA Status
OA Status
Publisher DOI
Citations
Tinani, S., & Rosenthal, J. (2022). A deterministic algorithm for the discrete logarithm problem in a semigroup. Journal of Mathematical Cryptology, 16, 141–155. https://doi.org/10.1515/jmc-2021-0022
