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 analyze the Sibert et al. group-based (Feige-Fiat-Shamir type)authentication protocol and show that the protocol is not computationallyzero-knowledge. In addition, we provide experimental evidence that our approachis practical and can succeed even for groups with no efficiently computablelength function such as braid groups. The novelty of this work is that we arenot attacking the protocol by trying to solve an underlying complex algebraicproblem, namely, the conjugacy search problem, but use a probabilisticapproach, instead.

Mean-Set Attack: Cryptanalysis of Sibert et al. Authentication Protocol