Results 191 to 200 of about 1,079 (213)
Some of the next articles are maybe not open access.

The Construction of Code-Based Cryptosystems

2013
Code-based cryptography was born in 1978 with the McEliece encryption scheme. The idea was simple and attractive: the public key is a scrambled generator matrix of a binary Goppa code and anyone can encrypt by transforming a piece data into a codeword which is obscured by adding to it a random error.
openaire   +1 more source

Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory

2015
The decoding of random linear codes is one of the most fundamental problems in both computational complexity theory and algorithmic cryptanalysis. Specifically, the best attacks known against existing code-based cryptosystems, such as McEliece, are unstructural, i.e., these attacks directly use generic decoding algorithms that treat the hidden binary ...
Maoning Wang, Mingjie Liu
openaire   +1 more source

An improved McEliece cryptosystem based on QC-MDPC code with compact key size

Telecommunication Systems, 2022
Xiaojun Tong, Tong Xiaojun
exaly  

On the failure of the smart approach of the GPT cryptosystem

Cryptologia, 2022
Hervé Tale Kalachi
exaly  

Post Quantum Code-Based Cryptosystems with Dual Inverse Matrix

2023 13th International Conference on Information Technology in Asia (CITA), 2023
Farshid Haidary Makoui   +2 more
openaire   +1 more source

Code-based Cryptosystem for Post-quantum Application

2017
Code-based public-key cryptosystems based on algebraic coding are considered. They are based on masking algebraic block codes with fast decoding algorithm (polynomial complexity) at random linear block code with NP-hard decoding. Assessment the strength is offered, including quantum cryptanalysis, and evaluating performance in comparison with the known
openaire   +1 more source

A knapsack public-key cryptosystem with cyclic code over $GF(2)$

JSIAM Letters, 2010
Yasuyuki Murakami, Takeshi Nasako
exaly  

Home - About - Disclaimer - Privacy