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 this paper we present a new primitive for a key exchange protocol based onmultivariate non-commutative polynomial rings, analogous to the classicDiffie-Hellman method. Our technique extends the proposed scheme of Boucher etal. from 2010. Their method was broken by Dubois and Kammerer in 2011, whoexploited the Euclidean domain structure of the chosen ring. However, ourproposal is immune against such attacks, without losing the advantages ofnon-commutative polynomial rings as outlined by Boucher et al. Moreover, ourextension is not restricted to any particular ring, but is designed to allowusers to readily choose from a large class of rings when applying the protocol.Our primitive can also be applied to other cryptographic paradigms. Inparticular, we develop a three-pass protocol, a public key cryptosystem, adigital signature scheme and a zero-knowledge proof protocol.

A New Primitive for a Diffie-Hellman-like Key Exchange Protocol Based on Multivariate Ore Polynomials