DLP in semigroups: Algorithms and lower bounds
The discrete logarithm problem (DLP) in semigroups has attracted some interests and serves as the foundation of many cryptographic schemes. In this work, we study algorithms and lower bounds for DLP in semigroups. First, we propose a variant of the deterministic algorithm for solving the cycle lengt...
Main Authors: | Han Jiao, Zhuang Jincheng |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2022-10-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2021-0049 |
Similar Items
-
Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem
by: Huang Ming-Deh, et al.
Published: (2020-06-01) -
Recovering Secrets From Prefix-Dependent Leakage
by: Ferradi Houda, et al.
Published: (2020-06-01) -
New lattice attacks on DSA schemes
by: Poulakis Dimitrios
Published: (2016-06-01) -
Can we Beat the Square Root Bound for ECDLP over 𝔽p2 via Representation?
by: Delaplace Claire, et al.
Published: (2020-08-01) -
Improved lower bound for Diffie–Hellman problem using multiplicative group of a finite field as auxiliary group
by: Kushwaha Prabhat
Published: (2018-06-01)