Private-key algebraic-code encryptions

DOI10.1109/18.32159zbMath0684.94009OpenAlexW2095767396MaRDI QIDQ4735133

No author found.

Publication date: 1989

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.32159

zbMATH Keywords

chosen-plaintext attacksPublic-key cryptosystemsvery large distance algebraic codesPrivate- key cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

How to Encrypt with the LPN Problem ⋮ Amount of key information contained in plain and encrypted text sets of the symmetric randomized McEliece cryptosystem ⋮ An Improved Rao–Nam Cryptosystem Based on Fractional Order Hyperchaotic System and EDF–QC–LDPC ⋮ A Secure and Efficient Code-Based Signature Scheme ⋮ A modified version of the Rao--Nam algebraic-code encryption scheme ⋮ Key generation of algebraic-code cryptosystems

This page was built for publication: Private-key algebraic-code encryptions