Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1212.0725

A note on quantum McEliece public-key cryptosystem

Li Yang, Min Liang

Published Dec 4, 2012• 2 citations
arXivHTMLPDF

Abstract

Inspired by Fujita's analysis [Quantum inf. & comput. 12(3&4), 2012], we suggest a twice-encryption scheme to improve the security of the original quantum McEliece public-key encryption algorithm.
DOI
10.48550/arxiv.1212.0725

Related papers

A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model

Rafael Dowsley, Jörn Müller‐Quade, Anderson C. A. Nascimento

Lecture notes in computer science•Jan 1, 2009•47 citations

A-6-7 Quantum McEliece Public-Key Cryptosystem

八郎 藤田

電子情報通信学会総合大会講演論文集•Mar 4, 2009•0 citations

Quantum McEliece public-key encryption scheme

Li Yang, Min Liang

This paper investigates a quantum version of McEliece public-key encryption (PKE) scheme, and analyzes its security. As is well known, the security of classical McEliece PKE is not stronger than the onewayness of related classical one-way function. We prove the security of quantum McEliece PKE ranks between them. Moreover, we propose the double-encryption technique to improve its security, and the security of the improved scheme is proved to be between the original scheme and the quantum one-time pad.

arXiv:1501.04895•Jan 19, 2015•3 citations

A Quantum Public-Key Encryption Scheme and Its Improvement

KEISUKE TANAKA

•Jan 1, 2001•0 citations

Quantum McEliece public-key cryptosystem

Hachiro Fujita

The McEliece cryptosystem is one of the best-known (classical) public-key cryptosystems, which is based on algebraic coding theory. In this paper, we present a quantum analogue of the classical McEliece cryptosystem. Our quantum McEliece public-key cryptosystem is based on the theory of stabilizer codes and has the key generation, encryption and decryption algorithms similar to those in the classical McEliece cryptosystem. We present an explicit construction of the quantum McEliece public-key cryptosystem using Calderbank-Shor-Steane codes based on generalized Reed-Solomon codes. We examine the security of our quantum McEliece cryptosystem and compare it with alternative systems.

Quantum Information and Computation•Mar 1, 2012•17 citations

Mathematical Analysis of Public Key Encryption Algorithm and Security of Anti Quantum Cryptography

彪高泽 唐

Advances in Applied Mathematics•Jan 1, 2018•0 citations
This paper investigates a quantum version of McEliece public-key encryption (PKE) scheme, and analyzes its security. As is well known, the security of classical McEliece PKE is not stronger than the onewayness of related classical one-way function. We prove the security of quantum McEliece PKE ranks between them. Moreover, we propose the double-encryption technique to improve its security, and the security of the improved scheme is proved to be between the original scheme and the quantum one-time pad.
The McEliece cryptosystem is one of the best-known (classical) public-key cryptosystems, which is based on algebraic coding theory. In this paper, we present a quantum analogue of the classical McEliece cryptosystem. Our quantum McEliece public-key cryptosystem is based on the theory of stabilizer codes and has the key generation, encryption and decryption algorithms similar to those in the classical McEliece cryptosystem. We present an explicit construction of the quantum McEliece public-key cryptosystem using Calderbank-Shor-Steane codes based on generalized Reed-Solomon codes. We examine the security of our quantum McEliece cryptosystem and compare it with alternative systems.