Results 151 to 160 of about 785 (182)
Some of the next articles are maybe not open access.
Code-Based Public-Key Cryptosystems and Their Applications
2010Code-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
Efficiency and Implementation Security of Code-based Cryptosystems
2013This 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
Fast and Secure Root Finding for Code-Based Cryptosystems
2012In 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 +3 more sources
A toolbox for software optimization of QC-MDPC code-based cryptosystems
Journal of Cryptographic Engineering, 2019The 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 +3 more sources
QC-LDPC Code-Based Cryptosystems
2014In 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
Attacking and Defending Code-based Cryptosystems
2012Today, 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
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
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
The Construction of Code-Based Cryptosystems
2013Code-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
2015The 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
Post Quantum Code-Based Cryptosystems with Dual Inverse Matrix
2023 13th International Conference on Information Technology in Asia (CITA), 2023Farshid Haidary Makoui +2 more
openaire +1 more source