Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

A p-ary MDPC scheme.

Guo, Qian LU and Johansson, Thomas LU orcid (2016) IEEE International Symposium on Information Theory (ISIT), 2016 p.1356-1360
Abstract
The McEliece public key cryptosystem is an attractive general construction that has received extensive attention over the years. Recently, a very promising version called QC-MDPC, was proposed. By using binary quasi-cyclic codes, the size of the public key can be decreased significantly. The decryption step involves iterative decoding of moderate density parity check codes (MDPC). In this paper we propose a non-binary version of QC-MDPC. The errors in the new scheme are discrete Gaussian and the decryption involves a new type of iterative decoding with a non-binary alphabet. The resulting scheme improves upon the binary QC-MDPC in that the size of the pubic key can be even smaller.
Please use this url to cite or link to this publication:
author
and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
host publication
IEEE International Symposium on Information Theory, ISIT 2016.
pages
5 pages
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE International Symposium on Information Theory (ISIT), 2016
conference location
Barcelona, Spain
conference dates
2016-07-10 - 2016-07-15
external identifiers
  • scopus:84986005225
ISBN
978-1-5090-1806-2
DOI
10.1109/ISIT.2016.7541520
language
English
LU publication?
yes
id
b4beb90f-dbc1-4b2b-90b3-7ca43994a7de
date added to LUP
2016-09-08 11:26:28
date last changed
2025-10-14 10:05:57
@inproceedings{b4beb90f-dbc1-4b2b-90b3-7ca43994a7de,
  abstract     = {{The McEliece public key cryptosystem is an attractive general construction that has received extensive attention over the years. Recently, a very promising version called QC-MDPC, was proposed. By using binary quasi-cyclic codes, the size of the public key can be decreased significantly. The decryption step involves iterative decoding of moderate density parity check codes (MDPC). In this paper we propose a non-binary version of QC-MDPC. The errors in the new scheme are discrete Gaussian and the decryption involves a new type of iterative decoding with a non-binary alphabet. The resulting scheme improves upon the binary QC-MDPC in that the size of the pubic key can be even smaller.}},
  author       = {{Guo, Qian and Johansson, Thomas}},
  booktitle    = {{IEEE International Symposium on Information Theory, ISIT 2016.}},
  isbn         = {{978-1-5090-1806-2}},
  language     = {{eng}},
  month        = {{07}},
  pages        = {{1356--1360}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  title        = {{A p-ary MDPC scheme.}},
  url          = {{http://dx.doi.org/10.1109/ISIT.2016.7541520}},
  doi          = {{10.1109/ISIT.2016.7541520}},
  year         = {{2016}},
}