Results 61 to 70 of about 8,486 (220)
Subspace subcodes of Reed-Solomon codes [PDF]
We introduce a class of nonlinear cyclic error-correcting codes, which we call subspace subcodes of Reed-Solomon (SSRS) codes. An SSRS code is a subset of a parent Reed-Solomon (RS) code consisting of the RS codewords whose components all lie in a fixed ...
Hattori, Masayuki +2 more
core +1 more source
Mem‐Transistor‐Based Gaussian Error–Generating Hardware for Post‐Quantum Cryptography Applications
The demonstration of a Gaussian error sampler system that leverages the intrinsic stochastic characteristics of mem‐transistor semiconductor devices. The demonstrated Gaussian error sampler significantly reduces computational and memory overhead compared to existing techniques.
Moon‐Seok Kim +3 more
wiley +1 more source
Improving the efficiency of the LDPC code-based McEliece cryptosystem through irregular codes
We consider the framework of the McEliece cryptosystem based on LDPC codes, which is a promising post-quantum alternative to classical public key cryptosystems.
Baldi, Marco +3 more
core +1 more source
Worst case QC-MDPC decoder for McEliece cryptosystem [PDF]
McEliece encryption scheme which enjoys relatively small key sizes as well as a security reduction to hard problems of coding theory. Furthermore, it remains secure against a quantum adversary and is very well suited to low cost implementations on ...
Chaulet, Julia, Sendrier, Nicolas
core +4 more sources
ABSTRACT With the advent of Quantum Computing and its exponential research endeavors in the past couple of decades, we are looking at a Golden Era of Quantum Computing. We are transitioning into an age of Hybrid Classical‐Quantum Computers, where the quantum computational resources are selectively harnessed for resource‐intensive tasks. On the one hand,
Vita Santa Barletta +4 more
wiley +1 more source
MicroEliece: McEliece for Embedded Devices [PDF]
Most advanced security systems rely on public-key schemes based either on the factorization or the discrete logarithm problem. Since both problems are known to be closely related, a major breakthrough in cryptanalysis tackling one of those problems could render a large set of cryptosystems completely useless.
Thomas Eisenbarth +3 more
openaire +1 more source
On Decoding Schemes for the MDPC-McEliece Cryptosystem [PDF]
Recently, it has been shown how McEliece public-key cryptosystems based on moderate-density parity-check (MDPC) codes allow for very compact keys compared to variants based on other code families. In this paper, classical (iterative) decoding schemes for
Bartz, Hannes, Liva, Gianluigi
core +1 more source
Comments on 'A class of codes for axisymmetric channels and a problem from the additive theory of numbers' by Varshanov, R. R. [PDF]
In the above paper [1], Varshamov considers discrete channels with q inputs and q outputs, q being an arbitrary ...
McEliece, Robert J.
core +1 more source
Towards quantum‐safe blockchain: Exploration of PQC and public‐key recovery on embedded systems
This paper addresses the need for quantum‐safe blockchain solutions specifically for embedded systems by integrating Post‐Quantum Cryptography (PQC) into blockchain frameworks. We propose a quantum‐secure blockchain architecture using NIST‐standardized PQC algorithms, finding Falcon‐512 to be optimal for embedded environments due to its security and ...
Dominik Marchsreiter
wiley +1 more source
On the symmetry of good nonlinear codes [PDF]
It is shown that there are arbitrarily long "good" (in the sense of Gilbert) binary block codes that are preserved under very large permutation groups. This result contrasts sharply with the properties of linear codes: it is conjectured that long cyclic ...
McEliece, Robert J.
core +1 more source

