McEliece and Niederreiter Cryptosystems Analysis in the Context of Post-Quantum Network Security

Vambol, Aleksei; Kharchenko, Vyacheslav; Potii, Olexandr; Bardis, Nikolaos G.

doi:10.1109/mcsi.2017.31

Cited by 5 publications

(11 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first probabilistic cipher was developed by Robert McEliece in 1978 [3]. The algorithm is based on binary linear codes and linear algebra over GF (2). The key pair generation includes the following actions [3]: 1) A binary linear (n, k)-code С with k × n generator matrix G is chosen at random.…”

Section: The Mceliece Ciphermentioning

confidence: 99%

“…The algorithm is suitable for digital signature applications [5], but the computational effort required for signature generation is larger compared to other quantum safe algorithms [1]. Similarly to the McEliece cipher, this cipher also employs linear algebra over GF (2) and binary linear codes.…”

Section: The Niederreiter Ciphermentioning

confidence: 99%

“…Post-quantum cryptography therefore, requires the development for a variety of innovative cryptographic algorithms that are resilient to attacks using quantum computers [1,2].…”

Section: Introductionmentioning

confidence: 99%

“…Representative schemes of this class are the McEliece and Niederreiter cryptographic algorithms that are developed based on the binary Goppa codes. The further development of the McEliece and Niederreiter algorithms is therefore highly relevant in the context of the advancement of post -quantum cryptography [1,2].…”

Section: Introductionmentioning

confidence: 99%

“…The given work analyzes both the classical versions of the aforementioned code-based cryptosystems and the Quasi-Cyclic MDPC McEliece cipher developed in order to reduce public key sizes. The analysis focuses especially on the operation of the binary Goppa codes and their contribution towards the cryptanalytic resilience of the classical McEliece and Niederreiter schemes [2]. Besides, an educational module "Introduction to Post-Quantum Cryptography", which has been developed by authors of paper, is briefly discussed.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Post-Quantum Network Security:McEliece and Niederreiter Cryptosystems Analysis and Education Issues

Vambol

Kharchenko

Potii

et al. 2020

Wseas Transactions on Systems and Control

Self Cite

View full text Add to dashboard Cite

The paper is aimed at analyzing of the classical McEliece and Niederreiter cryptosystems as well as theQuasi-Cyclic MDPC McEliece cipher in a context of the post-quantum network security. Theoretical foundations ofthe aforesaid cryptographic schemes are considered. The characteristics of the given cryptosystems and otherasymmetric encryption schemes are analyzed. The cipher metrics, which are considered in the paper, includecryptographic strength, performance, public key size and length of ciphertext. The binary Goppa codes are describedin the context of their role for the cryptanalytic resistance of the classic McEliece and Niederreiter schemes. Thecrucial advantages and drawbacks of the aforementioned cryptosystems are analyzed. The prospects for applicationof these ciphers to the network security protocols are outlined. The investigations, which are aimed at finding waysto reduce the public key sizes and improve the energy efficiency of the given ciphers, are briefly described. A neweducational module “Introduction to Post-Quantum Cryptography” is presented

show abstract

Section: The Mceliece Ciphermentioning

confidence: 99%

Section: The Niederreiter Ciphermentioning

confidence: 99%

“…Post-quantum cryptography therefore, requires the development for a variety of innovative cryptographic algorithms that are resilient to attacks using quantum computers [1,2].…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Post-Quantum Network Security:McEliece and Niederreiter Cryptosystems Analysis and Education Issues

Vambol

Kharchenko

Potii

et al. 2020

Wseas Transactions on Systems and Control

Self Cite

View full text Add to dashboard Cite

show abstract

ENR DigiSig: an efficient post-quantum digital signature scheme using polar codes

Khurana,

Narwal,

Ahlawat

2024

Quantum Inf Process

View full text Add to dashboard Cite

Analysis of code-based digital signature schemes

Khurana

Narwal

2023

IJECE

View full text Add to dashboard Cite

<span lang="EN-US">Digital signatures are in high demand because they allow authentication and non-repudiation. Existing digital signature systems, such as digital signature algorithm (DSA), elliptic curve digital signature algorithm (ECDSA), and others, are based on number theory problems such as discrete logarithmic problems and integer factorization problems. These recently used digital signatures are not secure with quantum computers. To protect against quantum computer attacks, many researchers propose digital signature schemes based on error-correcting codes such as linear, Goppa, polar, and so on. We studied 16 distinct papers based on various error-correcting codes and analyzed their various features such as signing and verification efficiency, signature size, public key size, and security against multiple attacks.</span>

show abstract

McEliece and Niederreiter Cryptosystems Analysis in the Context of Post-Quantum Network Security

Cited by 5 publications

References 13 publications

Post-Quantum Network Security:McEliece and Niederreiter Cryptosystems Analysis and Education Issues

Post-Quantum Network Security:McEliece and Niederreiter Cryptosystems Analysis and Education Issues

ENR DigiSig: an efficient post-quantum digital signature scheme using polar codes

Analysis of code-based digital signature schemes

Contact Info

Product

Resources

About