Results 91 to 100 of about 8,486 (220)

Side Channels in the McEliece PKC [PDF]

, 2008
The McEliece public key cryptosystem (PKC) is regarded as secure in the presence of quantum computers because no efficient quantum algorithm is known for the underlying problems, which this cryptosystem is built upon. As we show in this paper, a straightforward implementation of this system may feature several side channels.
Falko Strenzke, Erik Tews, H. Gregor Molter, Raphael Overbeck, Abdulhadi Shoufan   +4 more
openaire   +1 more source

Criptosistema de McEliece

, 2023
Departamento de Algebra, Geometría y ...
openaire   +1 more source

The Rényi Redundancy of Generalized Huffman Codes [PDF]

, 1988
Huffman's algorithm gives optimal codes, as measured by average codeword length, and the redundancy can be measured as the difference between the average codeword length and Shannon's entropy.
Blumer, Anselm C., McEliece, Robert J.
core  

Modern variations of McEliece and Niederreiter cryptosystems

Научно-технический вестник информационных технологий, механики и оптики
Classical cryptosystems proposed by Robert McEliece (1978) and Harold Niederreiter (1986) and their modern variations are studied. A detailed review of five code-based public key cryptosystems has been presented.
V. V. Davydov, V. V. Beliaev, E. F. Kustov, A. G. Leevik, S. V. Bezzateev   +4 more
doaj   +1 more source

A fast method for finding separable Goppa polynomials used in post-quantum McEliece-based cryptography

EURASIP Journal on Information Security
This paper introduces a simple and efficient method for generating Goppa polynomials used in post-quantum cryptography based on any variant of the McEliece algorithm.
Mariano Lopez-Garcia, Enrique Canto-Navarro   +1 more
doaj   +1 more source

NP-completeness of Certain Sub-classes of the Syndrome Decoding Problem [PDF]

, 2009
The problem of Syndrome Decoding was proven to be NP-complete in 1978 and, since then, quite a few cryptographic applications have had their security rely on the (provable) difficulty of solving some instances of it. However, in most cases, the instances
Finiasz, Matthieu
core  

Codes, Cryptography, and the McEliece Cryptosystem [PDF]

, 2020
Over the past several decades, technology has continued to develop at an incredible rate, and the importance of properly securing information has increased significantly. While a variety of encryption schemes currently exist for this purpose, a number of
Matsick, Bethany
core   +1 more source

Development of digital signature algorithm based on the Niederriter crypto-code system

Системи обробки інформації, 2020
The development of computing resources in the post-quantum period calls into question the provision of the required level of stability of symmetric and asymmetric cryptography algorithms. The advent of a full-scale quantum computer based on the Shore and
О.С. Циганенко
doaj   +1 more source

McEliece-koodaussysteemi

, 2023
Tiivistelmä. Tässä tutkielmassa esitellään McEliece-koodaussysteemi, tämän pohjalta muodostettu CFS-allekirjoitussysteemi ja kaksi erilaista tapaa hyökätä McEliece-koodaussysteemiin. Ennen McEliece-koodaussysteemin määrittelemistä määritellään tarpeellisia algebran, matriisiteorian ja koodausteorian käsitteitä.
openaire   +1 more source

p-Adic valuation of weights in Abelian codes over /spl Zopf/(p/sup d/) [PDF]

, 2005
Counting polynomial techniques introduced by Wilson are used to provide analogs of a theorem of McEliece. McEliece's original theorem relates the greatest power of p dividing the Hamming weights of words in cyclic codes over GF (p) to the length of the ...
Katz, Daniel J.
core