Sciweavers

7 search results - page 1 / 2
» A New Analysis of the McEliece Cryptosystem Based on QC-LDPC...
Sort
View
SCN
2008
Springer
194views Communications» more  SCN 2008»
13 years 4 months ago
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
We improve our proposal of a new variant of the McEliece cryptosystem based on QC-LDPC codes. The original McEliece cryptosystem, based on Goppa codes, is still unbroken up to now,...
Marco Baldi, Marco Bodrato, Franco Chiaraluce
PQCRYPTO
2010
176views Cryptology» more  PQCRYPTO 2010»
13 years 3 months ago
Practical Power Analysis Attacks on Software Implementations of McEliece
The McEliece public-key cryptosystem is based on the fact that decoding unknown linear binary codes is an NP-complete problem. The interest on implementing post-quantum cryptograph...
Stefan Heyse, Amir Moradi, Christof Paar
ICC
2007
IEEE
102views Communications» more  ICC 2007»
13 years 11 months ago
Quasi-Cyclic Low-Density Parity-Check Codes in the McEliece Cryptosystem
Abstract—In this paper, a new variant of the McEliece cryptosystem, based on Quasi-Cyclic Low-Density Parity-Check (QCLDPC) codes, is studied. In principle, such codes can substi...
Marco Baldi, Franco Chiaraluce, Roberto Garello, F...
PQCRYPTO
2010
298views Cryptology» more  PQCRYPTO 2010»
13 years 8 months ago
Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
Abstract. In this paper a new structural attack on the McEliece/Niederreiter public key cryptosystem based on subcodes of generalized ReedSolomon codes proposed by Berger and Loidr...
Christian Wieschebrink
IMA
1995
Springer
97views Cryptology» more  IMA 1995»
13 years 8 months ago
A New Algorithm for Finding Minimum-Weight Words in Large Linear Codes
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
Anne Canteaut