Abstract
The paper presents an original interpretation of the Shannon's ideas related to the concept of privacy with respect to the theoretical symmetric cryptographic transformations in computer cryptography and computation of posterior probabilities of the initial messages and keys. Used representation of symmetric cryptographic transformation as a relation on the set of tuples of the initial messages, keys and cryptograms, which is formed by the Cartesian product of the corresponding sets of finite sequences of 0 and 1. For reasons of practical use and providing a theoretical secrecy defined properties of such relation. The above calculation method can easily be programmed using well-known programming languages. The results help to simplify the process of studying relevant theoretical positions and can be used in the preparation of teaching materials for the presentation of the fundamentals of computer cryptography.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Legal, regulatory and metrological support of information security system in Ukraine
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
