Search
Search Results
-
Skew differential Goppa codes and their application to Mceliece cryptosystem
A class of linear codes that extends classical Goppa codes to a non-commutative context is defined. An efficient decoding algorithm, based on the...
-
Secure Data Storage in Cloud Computing Using Code Based McEliece and NTRU Cryptosystems
Information must be kept private and secure because it is shared when people communicate online, making data protection essential. Data sharing is a...
-
UC Analysis of the Randomized McEliece Cryptosystem
In this paper, we will examine the UC (Universal Composability) security of an improved version of the McEliece cryptosystem, namely the Randomized...
-
A New Approach Based on Quadratic Forms to Attack the McEliece Cryptosystem
We introduce a novel algebraic approach for attacking the McEliece cryptosystem which is currently at the 4-th round of the NIST competition. The...
-
Two modifications for Loidreau’s code-based cryptosystem
This paper presents two modifications for Loidreau’s cryptosystem, a rank metric-based cryptosystem constructed by using Gabidulin codes in the...
-
On the design and security of Lee metric McEliece cryptosystems
Recently, Horlemann-Trautmann and Weger (Adv Math Commun, https://doi.org/10.3934/amc.2020089 , 2020) proposed a general framework for a Quaternary...
-
Efficient Implementation of the Classic McEliece on ARMv8 Processors
Classic McEliece is a Code-based Key Encapsulation Mechanisms (KEM) and one of the candidate algorithms in the NIST PQC competition. Based on the...
-
A Side-Channel Attack Against Classic McEliece When Loading the Goppa Polynomial
The NIST Post-Quantum Cryptography (PQC) standardization challenge was launched in December 2016 and recently, has released its first results. The...
-
Finding Enumerators for Generalized (L, G)-Code
AbstractThe algorithm for finding the enumerators of degree 2 and higher for the generalized ( L , G )‑code is presented. This algorithm makes it...
-
Moderate Classical McEliece Keys from Quasi-Centrosymmetric Goppa Codes
As the development of quantum machines is booming and would threaten our standard cryptography algorithms, a transition period is necessary for the...
-
A Safety-Critical, RISC-V SoC Integrated and ASIC-Ready Classic McEliece Accelerator
Security is an integral part of ensuring the integrity of safety-critical systems. Safety-critical systems with extremely long-lifespan, such as the...
-
Cryptanalysis of Ivanov–Krouk–Zyablov Cryptosystem
Recently, F. Ivanov, E. Krouk and V. Zyablov proposed new cryptosystem based of Generalized Reed–Solomon (GRS) codes over field extensions. In their...
-
How to Backdoor (Classic) McEliece and How to Guard Against Backdoors
We show how to backdoor the McEliece cryptosystem such that a backdoored public key is indistinguishable from a usual public key, but allows to...
-
McEliece-Type Encryption Based on Gabidulin Codes with No Hidden Structure
This paper presents a new McEliece-type public key encryption scheme based on Gabidulin codes, which uses linearized transformations to disguise the...
-
Key-Recovery Fault Injection Attack on the Classic McEliece KEM
We present a key-recovery fault injection attack on the Classic McEliece Key Encapsulation Mechanism (KEM). The fault injections target the...
-
Security and Complexity of a New Variant of the McEliece Cryptosystem Using Non-linear Convolutional Codes
The McEliece public-key cryptography (PKC) has fewer encryption/decryption operations compared to other PKC schemes such as RSA, ECC, and ElGamal....
-
Verifying Classic McEliece: Examining the Role of Formal Methods in Post-Quantum Cryptography Standardisation
Developers of computer-aided cryptographic tools are optimistic that formal methods will become a vital part of develo** new cryptographic systems....
-
Comparative Study on the McEliece Public-Key Cryptosystem Based on Goppa and QC-MDPC Codes
In recent years, much research has been conducted on quantum computers – machine that exploit the phenomena of quantum mechanics to solve difficult...
-
Decoding McEliece with a Hint – Secret Goppa Key Parts Reveal Everything
We consider the McEliece cryptosystem with a binary Goppa code $$C \subset...
-
Probabilistic root finding in code-based cryptography
Probabilistic algorithms for finding roots of polynomials have not been applied to code-based cryptography before. One obstacle is their non-constant...
