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

Due to the recent challenges in post-quantum cryptography, several newapproaches for code-based cryptography have been proposed. For example, avariant of the McEliece cryptosystem based on interleaved codes was proposed.In order to deem such new settings secure, we first need to understand andanalyze the complexity of the underlying problem, in this case the problem ofdecoding a random interleaved code. A simple approach to decode such codes,would be to randomly choose a vector in the row span of the received matrix andrun a classical information set decoding algorithm on this erroneous codeword.In this paper, we propose a new generic decoder for interleaved codes, which isan adaption of the classical idea of information set decoding by Prange andperfectly fits the interleaved setting. We then analyze the cost of the newalgorithm and a comparison to the simple approach described above shows thesuperiority of Interleaved Prange.

Interleaved Prange: A New Generic Decoder for Interleaved Codes