English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We present a polynomial-time reduction of the discrete logarithm problem inany periodic (a.k.a. torsion) semigroup (SGDLP) to the same problem in asubgroup of the same semigroup. It follows that SGDLP can be solved inpolynomial time by quantum computers, and that SGDLP has subexponentialalgorithms whenever the classic DLP in the corresponding groups hassubexponential algorithms.

A reduction of semigroup DLP to classic DLP