Amount of key information contained in plain and encrypted text sets of the symmetric randomized McEliece cryptosystem

DOI10.1007/S10559-020-00288-9MaRDI QIDQ2215846zbMATH OpenOpenAlexWikidataFDO

Authors S. V. Mitin

Publication date 14 December 2020

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-020-00288-9

zbMATH Keywords

code-based cryptographyamount of informationMcEliece encryption schemerandomized code cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60) Other types of codes (94B60)

Recommendations

• Publication:3202943
• On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
• Enhanced public key security for the McEliece cryptosystem
• scientific article; zbMATH DE number 4070796
• scientific article; zbMATH DE number 2154508

Cites work

• scientific article; zbMATH DE number 3793925 (Why is no real title available?)
• Efficient secure channel coding based on quasi-cyclic low-density parity-check codes
• Nonlinearity statistical properties of Boolean function restrictions on a randomly chosen subspace
• Private-key algebraic-code encryptions
• Semantic security for the McEliece cryptosystem without random oracles

Cited in

(2)

• Semantic security and key-privacy with random split of St-Gen codes
• Symmetric text encryption scheme based Karhunen Loeve transform

Describes a project that uses

Uses Software

• McEliece

This page was built for publication: Amount of key information contained in plain and encrypted text sets of the symmetric randomized McEliece cryptosystem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215846)