Recent progress on the elliptic curve discrete logarithm problem | SpringerLink Skip to main
content Advertisement SpringerLink Log in Menu Find a journal Publish with us Search Cart …

Linear complementary dual (LCD) codes are a class of linear codes introduced by Massey
in 1964. LCD codes have been extensively studied in literature recently. In addition to their …

Motivated by the application of high-density data storage technologies, symbol-pair codes
are proposed to protect against pair-errors in symbol-pair channels, whose outputs are …

Code-based cryptography has aroused wide public concern as one of the main candidates
for post quantum cryptography to resist attacks against cryptosystems from quantum …

Counting subset sums of finite abelian groups Page 1 Journal of Combinatorial Theory, Series A
119 (2012) 170–182 Contents lists available at ScienceDirect Journal of Combinatorial Theory …

The maximum likelihood decoding problem (MLD) is known to be NP-hard and its
complexity is strictly related to the security of some post-quantum cryptosystems, that is, the …

We propose a novel post-quantum code-based digital signature algorithm whose security is
based on the difficulty of decoding Quasi-Cyclic codes in systematic form, and whose …

Establishing the complexity of bounded distance decoding for Reed--Solomon codes is a
fundamental open problem in coding theory, explicitly asked by Guruswami and Vardy IEEE …

In this paper we present a new gap-creating randomized self-reduction for parameterized
Maximum Likelihood Decoding problem over $\mathbb {F} _p $($ k $-MLD $ _p $). The …

We give a method to construct deep holes for elliptic curve codes. For long elliptic curve
codes, we conjecture that our construction is complete in the sense that it gives all deep …