Search
Search Results
-
Coding and bounds for partially defective memory cells
This paper considers coding for so-called partially stuck (defect) memory cells. Such memory cells can only store partial information as some of...
-
On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes
We determine, up to an additive constant 2, the minimum depth required to encode asymptotically good error-correcting codes using a linear number of...
-
A new metric on symmetric groups and applications to block permutation codes
Permutation codes have received a great attention due to various applications. For different applications, one needs permutation codes under...
-
Generic Error SDP and Generic Error CVE
This paper introduces a new family of CVE schemes built from generic errors (GE-CVE) and identifies a vulnerability therein. To introduce the...
-
On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
We define two metrics on vector spaces over a finite field using the linear complexity of finite sequences. We then develop coding theory notions for...
-
Asymmetric entanglement-assisted quantum codes: bound and constructions
The theory of quantum error-correcting codes has been extended to asymmetric quantum channels-qubit-flip and phase-shift errors may have equal or...
-
LRPC Codes with Multiple Syndromes: Near Ideal-Size KEMs Without Ideals
We introduce a new rank-based key encapsulation mechanism (KEM) with public key and ciphertext sizes around 3.5 Kbytes each, for 128 bits of...
-
On non-binary traceability set systems
We introduce non-binary IPP set systems with traceability properties that have IPP codes and binary IPP set systems with traceability capabilities as...
-
Steane-enlargement of quantum codes from the Hermitian function field
In this paper, we study the construction of quantum codes by applying Steane-enlargement to codes from the Hermitian function field. We cover...
-
Achieving Positive Rates with Predetermined Dictionaries
In the first part of the paper we consider binary input channels that are not necessarily stationary and show how positive rates can be achieved...
-
Quasi-cyclic constructions of asymmetric quantum error-correcting codes
Asymmetric quantum error-correcting codes (AQECCs) are an extremely efficient coding scheme against the different occurring probabilities of...
-
Post-quantum Secure Stateful Deterministic Wallet from Code-Based Signature Featuring Uniquely Rerandomized Keys
The deterministic wallet is a promising cryptographic primitive used in cryptocurrencies to protect users’ wealth where a key derivation process...
-
Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets
We improve the flexibility in designing access structures of quantum stabilizer-based secret sharing schemes for classical secrets, by introducing...
-
Densities of codes of various linearity degrees in translation-invariant metric spaces
We investigate the asymptotic density of error-correcting codes with good distance properties and prescribed linearity degree, including (sub)linear...
-
Information Set Decoding for Lee-Metric Codes Using Restricted Balls
The Lee metric syndrome decoding problem is an NP-hard problem and several generic decoders have been proposed. The observation that such decoders...
-
An Analysis of the RankSign Signature Scheme with Rank Multipliers
We investigate the application of rank multipliers as introduced by Loidreau to repair the 2017 NIST proposal RankSign. In RankSign, a signature is...
-
Non-malleable Codes with Optimal Rate for Poly-Size Circuits
We give an explicit construction of non-malleable codes with rate \(1-o(1)\)...
-
Reduction from Sparse LPN to LPN, Dual Attack 3.0
The security of code-based cryptography relies primarily on the hardness of decoding generic linear codes. Until very recently, all the best...