The improvements on quantum technology are threatening our daily cybersecurity, as a
capable quantum computer can break all currently employed asymmetric cryptosystems. In …

Abstract The Restricted Syndrome Decoding Problem (R-SDP) cor-responds to the
Syndrome Decoding Problem (SDP) with the additional constraint that all entries of the …

In this work, we introduce a new code-based signature scheme, called FuLeeca, based on
the NP-hard problem of finding codewords of given Lee-weight. The scheme follows the …

In this paper we focus on modules over a finite chain ring R of size q s. We compute the
density of free modules of R n, where we separately treat the asymptotics in n, q and s. In …

Code-based cryptosystems are promising candidates for post-quantum cryptography.
Recently, generalized concatenated codes over Gaussian and Eisenstein integers were …

Stern's signature scheme is a historically important code-based signature scheme. A crucial
optimization of this scheme is to generate pseudo-random vectors and permutation instead …

Several recently proposed code-based cryptosystems base their security on a slightly
generalized version of the classical (syndrome) decoding problem. Namely, in the so-called …

The Lee metric syndrome decoding problem is an NP-hard problem and several generic
decoders have been proposed. The observation that such decoders come with a larger cost …

Most low-density parity-check (LDPC) code constructions are considered over finite fields. In
this work, we focus on regular LDPC codes over integer residue rings and analyze their …

The problem of scalar multiplication applied to vectors is considered in the Lee metric.
Unlike in other metrics, the Lee weight of a vector may be increased or decreased by the …