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

Code-Based Cryptosystems Evolution

2017 IVth International Conference on Engineering and Telecommunication (EnT), 2017
This paper describes the original linear code-based cryptosystem and shows how it evolves after successful structural-based attacks have been discovered. All existing modifications of the original Niederreiter public-key algorithm have been classified based on improvements and classified accordingly common characteristics and variety of parameters ...
Marina Samokhina, Oksana Trushina
openaire   +1 more source

Skew‐cyclic codes based public‐key cryptosystem approach

SECURITY AND PRIVACY, 2022
AbstractThis is a survey on the theory of skew‐cyclic codes over the ring , where v2 = v. Coding theory plays an important role in the constructing cryptosystems. In this survey, we propose a public‐key cryptosystem using skew‐cyclic codes. The encryption is done by the Gray map ψ and the projection map φ is used for decryption.
Murat Güzeltepe, Selda Çalkavur
openaire   +2 more sources

Code-based cryptosystems from NIST PQC

2018 IEEE 9th International Conference on Dependable Systems, Services and Technologies (DESSERT), 2018
In this paper we research code-based electronic digital signature schemes, which ware submitted to the contest of post-quantum crypto algorithms NIST PQC. There are explored general characteristics of the algorithms and basic properties and parameters estimated.
Alexandr Kuznetsov   +4 more
openaire   +1 more source

Efficiency and Implementation Security of Code-based Cryptosystems

2013
This thesis studies efficiency and security problems of implementations of code-based cryptosystems. These cryptosystems, though not currently used in the field, are of great scientific interest, since no quantum algorithm is known that breaks them essentially faster than any known classical algorithm.
openaire   +2 more sources

Code-Based Public-Key Cryptosystems and Their Applications

2010
Code-based public-key cryptosystems are based on the hardness of a decoding problem. Their advantages include: 1) quantum tolerant, i.e. no polynomial time algorithm is known even on quantum computers whereas number theoretic public-key cryptosystems, such as RSA, Elliptic Curve Cryptosystems, DH, DSA, are vulnerable against them. 2) arithmetic unit is
openaire   +1 more source

A toolbox for software optimization of QC-MDPC code-based cryptosystems

Journal of Cryptographic Engineering, 2019
The anticipated emergence of quantum computers in the foreseeable future drives the cryptographic community to start considering cryptosystems, which are based on problems that remain intractable even with large-scale quantum computers. One example is the family of code-based cryptosystems that relies on the syndrome decoding problem.
Nir Drucker, Shay Gueron
openaire   +2 more sources

Fast and Secure Root Finding for Code-Based Cryptosystems

2012
In this work we analyze five previously published respectively trivial approaches and two new hybrid variants for the task of finding the roots of the error locator polynomial during the decryption operation of code-based encryption schemes. We compare the performance of these algorithms and show that optimizations concerning finite field element ...
openaire   +2 more sources

Attacking and Defending Code-based Cryptosystems

2012
Today, cryptographic applications are used in nearly all areas of our lives, including the economy, health, military, and entertainment. Without them, society would change in ways we can hardly imagine. Since the publication of Shor's algorithm in 1994, however, we know that those cryptographic applications based on the problems of factoring and ...
openaire   +1 more source

QC-LDPC Code-Based Cryptosystems

2014
In this chapter, the use of QC-LDPC codes in public key cryptosystems inspired to the McEliece and Niederreiter systems is studied. Both the case in which the private and the public code are permutation equivalent and that in which such an equivalence is absent are considered.
openaire   +1 more source

Post-Quantum Cryptosystems: Open Problems and Current Solutions. Isogeny-Based and Code-Based Cryptosystems

Journal of Applied and Industrial Mathematics
Summary: This paper is a survey of modern post-quantum cryptographic schemes based on codes and isogenies. Special attention is paid to cryptanalysis of these schemes. In particular, for code-based cryptosystems we describe the information set decoding and the support splitting algorithm as main attacks, and for cryptosystems based on isogenies we ...
Malygina, E. S.   +7 more
openaire   +1 more source

Home - About - Disclaimer - Privacy