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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory Jg. 64; H. 5; S. 3927 - 3943
Hauptverfasser:	Aguilar-Melchor, Carlos, Blazy, Olivier, Deneuville, Jean-Christophe, Gaborit, Philippe, Zemor, Gilles
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.05.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!