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

In a paper of P. Paillier and J. Villar a conjecture is made about themalleability of an RSA modulus. In this paper we present an explicit algorithmrefuting the conjecture. Concretely we can factorize an RSA modulus n usingvery little information on the factorization of a concrete n' coprime to n.However, we believe the conjecture might be true, when imposing some extraconditions on the auxiliary n' allowed to be used. In particular, the papershows how subtle the notion of malleability is.

Small primitive roots and malleability of RSA moduli