Efficient Encryption From Random Quasi-Cyclic Codes

We propose a framework for constructing efficient code-based encryption schemes that do not hide any structure in their public matrix. The framework is in the spirit of the schemes first proposed by Alekhnovich in 2003 and based on the difficulty of decoding random linear codes from random errors of...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 64; no. 5; pp. 3927 - 3943
Main Authors:	Aguilar-Melchor, Carlos, Blazy, Olivier, Deneuville, Jean-Christophe, Gaborit, Philippe, Zemor, Gilles
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.05.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Subjects:	Code-based cryptography Codes Computer Science Computer systems Cryptography Cryptography and Security Data encryption Decoding Encoding Encryption Failure analysis Information Theory Mathematics Measurement Parameters Parity post-quantum cryptography provable security Public key public-key encryption Random errors Security Weight
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!