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/

Global: Zendy Plus annual

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

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper proposes a new signature scheme based on two hard problems : thecube root extraction modulo a composite moduli (which is equivalent to thefactorisation of the moduli, IFP) and the discrete logarithm problem(DLP). Bycombining these two cryptographic assumptions, we introduce an efficient andstrongly secure signature scheme. We show that if an adversary can break thenew scheme with an algorithm $\mathcal{A},$ then $\mathcal{A}$ can be used tosove both the DLP and the IFP. The key generation is a simple operation basedon the discrete logarithm modulo a composite moduli. The signature phase isbased both on the cube root computation and the DLP. These operations arecomputationally efficient.

An Efficient Signature Scheme based on Factoring and Discrete Logarithm