The Niederreiter cryptosystem and Quasi-Cyclic codes

11/02/2019
by   Upendra Kapshikar, et al.
0

McEliece and Niederreiter cryptosystems are robust and versatile cryptosystems. These cryptosystems work with any linear error-correcting codes. They are popular these days because they can be quantum-secure. In this paper, we study the Niederreiter cryptosystem using quasi-cyclic codes. We prove, if these quasi-cyclic codes satisfy certain conditions, the corresponding Niederreiter cryptosystem is resistant to the hidden subgroup problem using quantum Fourier sampling. Our proof requires the classification of finite simple groups.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2018

A Quantum-Secure Niederreiter Cryptosystem using Quasi-Cyclic Codes

In this paper, we describe a new Niederreiter cryptosystem based on quas...
research
05/25/2018

McEliece-type Cryptosystems over Quasi-cyclic Codes

In this thesis, we study algebraic coding theory based McEliece-type cry...
research
06/12/2019

Good Stabilizer Codes from Quasi-Cyclic Codes over F_4 and F_9

We apply quantum Construction X on quasi-cyclic codes with large Hermiti...
research
07/04/2021

Expanded Gabidulin Codes and Their Application to Cryptography

This paper presents a new family of linear codes, namely the expanded Ga...
research
03/14/2018

On the Security of Some Compact Keys for McEliece Scheme

In this paper we study the security of the key of compact McEliece schem...
research
10/11/2021

Quasi-Cyclic Stern Proof of Knowledge

The 1993 Stern authentication protocol is a code-based zero-knowledge pr...

Please sign up or login with your details

Forgot password? Click here to reset