Efficient implementation of a CCA2-Secure variant of mceliece using generalized srivastava codes
Citations
457 citations
320 citations
206 citations
119 citations
112 citations
Cites methods from "Efficient implementation of a CCA2-..."
...2) Most code-based candidates make use of quasi-cyclic codes or are based on McEliece or Niederreiter schemes....
[...]
...11) NTS-KEM [121]: It is a code-based post-quantum cryptosystem based on McEliece and Niederreiter schemes....
[...]
...2) Classic McEliece [112]: It is a key encapsulation mechanism (KEM) built from Niederreiter’s dual version of McEliece’s PKE (Public-Key Encryption) using binary Goppa codes....
[...]
...A relevant code-based cryptosystem is McEliece’s [67]....
[...]
...For instance, in [183] an implementation of McEliece is detailed that requires 1.079 ms for encryption and 10.726 ms for decryption....
[...]
References
10,083 citations
1,541 citations
"Efficient implementation of a CCA2-..." refers background in this paper
...This problem is well known and was proved to be NP-complete [7]....
[...]
1,441 citations
1,000 citations