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

We consider the decoding problem or the problem of finding low weightcodewords for rank metric codes. We show how additional information about thecodeword we want to find under the form of certain linear combinations of theentries of the codeword leads to algorithms with a better complexity. This isthen used together with a folding technique for attacking a McEliece schemebased on LRPC codes. It leads to a feasible attack on one of the parameterssuggested in \cite{GMRZ13}.

New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem