A fast method for complete randomization of messages.

MaRDI QIDQ1271417zbMATH OpenFDO

Authors A. N. Fionov, B. Ya. Ryabko

Publication date 20 November 1998

Published in Problems of Information Transmission (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Publication:4936731
• scientific article; zbMATH DE number 30329
• Randomness-dependent message security
• LATIN 2004: Theoretical Informatics
• scientific article; zbMATH DE number 177547
• A Fast Derandomization Scheme and Its Applications
• scientific article; zbMATH DE number 3919629
• Arithmetic coding of messages using random sequence
• A random encoding method for secure data communication: An extension of sequential coding

Cited in

(9)

• The destruction of frequencies of letters through regular combinatorial structures
• Homophonic coding with logarithmic memory size
• Efficient homophonic coding
• On the method of random coding
• Interval algorithm for homophonic coding
• Cryptographic transformations of non-Shannon sources of information
• scientific article; zbMATH DE number 2169185 (Why is no real title available?)
• scientific article; zbMATH DE number 1396781 (Why is no real title available?)
• Analog random coding

This page was built for publication: A fast method for complete randomization of messages.

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