Efficient homophonic coding

DOI10.1109/18.782143MaRDI QIDQ4503392zbMATH OpenOpenAlexFDO

Authors Andrei Fionov, B. Ya. Ryabko

Publication date 7 September 2000

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

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

zbMATH Keywords

homophonic codinghomophonic substitutionrandomizationsecret key cryptosystemssource coding

Mathematics Subject Classification ID

Source coding (94A29) Cryptography (94A60)

Recommendations

• A fast and efficient homophonic coding algorithm
• Homophonic coding with logarithmic memory size
• A fast method for complete randomization of messages.
• scientific article; zbMATH DE number 1455099
• Publication:4936731

Cited in

(15)

• On numerically decipherable codes and their homophonic partitions
• An approach for stream ciphers design based on joint computing over random and secret data
• Universal homophonic coding scheme using differential encoding and interleaving
• A homophonic DES
• A Cryptographic Code Based on Digraphs
• Equivocations for Homophonic Ciphers
• scientific article; zbMATH DE number 4070801 (Why is no real title available?)
• scientific article; zbMATH DE number 1099632 (Why is no real title available?)
• Homophonic coding with logarithmic memory size
• scientific article; zbMATH DE number 1455099 (Why is no real title available?)
• Interval algorithm for homophonic coding
• Rising of efficiency of enciphering on the basis of summation of products
• scientific article; zbMATH DE number 1396781 (Why is no real title available?)
• Unconditionally secure short key ciphers based on data compression and randomization
• A fast and efficient homophonic coding algorithm

This page was built for publication: Efficient homophonic coding

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