Probabilistic Methods for Information Security

• The text discusses probabilistic methods for ensuring information security in information technology, as well as symmetric encryption systems and elements of their cryptographic analysis

Introduction

• Information technologies involve processes that use methods for collecting, processing, accumulating, and transferring data to produce new insights about objects, processes, phenomena, and information products
• These technologies also encompass the distribution of information and the means of implementing these processes
• Information technologies include techniques for using computing devices to perform functions for data collection, as well as storage, processing, transmission, and data use
• Resources are needed for collecting, processing, storing, and disseminating information

Information Categories

• Information is divided into two types: knowledge gained from observations made by individuals is considered knowledge, while knowledge created in material form by humans or technology is called messages
• The main tasks for the owner of valuable messages are to ensure their secure storage, which includes managing access control for various user categories; and to prevent distortion and unauthorized access when transferring messages between legitimate users

Contemporary Security Measures

• Modern methods for protecting data, such as regulating information ownership and use, are classified based on objectives
• Organizational and administrative ways are geared towards ensuring confidentiality at enterprises with valuable data, to counter intruders via trusted zones, safes, and storage facilities
• Legal methods protect information via property rights and the regulation of information use
• Engineering aspects focuses on providing data protection within a certain zone/area
• Preventing leaks is a key element, whether leaks are acoustic or electromagnetic, expecially when processing info with other devices
• This includes creating secure storage, secure containers and transmission channels that prevent the removal of data from the communication line
• Steganographic methods are used to conceal secrets within non-secret messages, hiding the very existence of the secret message by taking advantage of the redundancy of information
• Examples: writing secret messages with ink, or imperceptibly embedding a hidden message in an image by modifying pixel values
• Cryptographic techniques are a way to provide information security

Cryptography Foundations

• Cryptography is the field of theoretical and applied study committed to creating and using methods of cryptographic protection of data
• Cryptography specializes in synthesis and analysis, practically developing/implementing cryptographic data security
• A cryptographic system, or cryptosystem, serves as a structured framework that uses particular ways to handle tasks in data protection in information technologies
• It achieves this by relying on means of cryptographic data security
• A cryptographic system has a primary functional subsystem that provides solutions for a set of defined protection tasks
• Each has an essential key system for its functioning. Subsystem elements may include things like authentication codes, schemes for digital signatures or protocols, and other functions
• This provides very specific solutions for said data security tasks
• Symmetric, asymmetric, and hybrid cryptosystems are determined by cryptographic keys that are being used
• Cryptographic protection refers to the safeguarding of data through its cryptographic transformation
• A cryptographic key is a modifiable parameter in the form of a sequence of symbols

Cryptographic concepts

• Cryptographic resistance pertains to the attribute of a system or a mechanism resistant to attacks against its cryptographic components
• A cipher's resistance against attacks is measured by how hard it is to restore keys given the open and encrypted text, the hash strength or finding collisions
• There are practical and theoretical approaches to cryptographic strength
• The strength of a crypto system depends on its mechanisms and how they are employed
• “Attack” is defined, influencing its operations using very detailed operational data that hides parameters that are meant to remain secret for the system /mechanism
• Its also aimed at violating functions to address data security problems

Types of attacks

• Active attacks impact crypto systems with repeating or replacing messages
• A passive attack monitors communication to get secret data

Additional terminology

• Cryptography consists of mathematical techniques to convert protected information
• Cryptographers are tasked with detailing methods using mathematical subsets such as theories of probabilities and statistics

Binary Image Characteristics

• Boolean or binary functions emerged in the second part of the19th century as a result of study in the fields of mathematical logic
• Applying the idea of binary functions showed itself to be effective to the problems of the discrete device analysis, devices performing information processing
• Examining the probabilistic aspects of binary functions is relevant for security in information technology
• The section looks into how binary functions are arranged methodically with probabilistic views, which are arithmetically demonstrated with combinations
• In probability, arguments are regarded as indicator coincidental variables, thus a binary function is explored as indicator variables
• Random Variables (RV), that take two values, are considered most simple
• Building indicator tests helps with difficult probability theories
• Most simple, indicators show random indicator properties

Binary illustrations of Indenpence

• Suppose that we have a specific probability distribution (VP) (Ω,A,P). A function §:Ω → R is named a coincidental quantity if a borel subset BCR full pre displays
• displays to it in σ-algebra: ξ¯¹(В) ∈ А.
• CB ξ is discrete, if an image (2) space of elementary events is not more than an account set
• Simple SV ξ shows indicator features, if § (2) ⊂ {0,1}
• Indicator of A = §-¹{1} events will be indicated
• in this case with an indicator § with numerous V, indicators are called binary CB
• Any Binary Functions f(x):V -> V, shows binary incidental amount, then a distribution is set
• All of the functions V -> {0,1}

Probabilistic Method for calulating binary weight

• The incoming opinion of prevalence has great importance, originating as a number of indicator data
• Now it shows several sums, with distinct discrete functional characters with a range of the line with Fourier- Walsha
• The prevalence of indicator has to include the calculation
• Also be concerned that D(5+1) + - d(5) turns the importance

Linearly Related aspects

• Each indicator 5 is linear with Cb (-1) via the correlations, thus the formula has to consider this factor