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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a "hidden" element 2 IFp, where p is prime, from very short strings of the most signif- icant bits of the residue of t modulo p for several randomly chosen t 2 IFp. Here we modify the scheme and amplify the uniformity of dis- tribution of the 'multipliers' t and thus extend this result to subgroups of IF p, which are more relevant to practical usage. As in the work of Boneh and Venkatesan, our result can be applied to the bit security of Die-Hellman related encryption schemes starting with subgroups of very small size, including all cryptographically interesting subgroups.

A Nonuniform Algorithm for the Hidden Number Problem in Subgroups