0% found this document useful (0 votes)
48 views11 pages

Understanding the CIA Triad in Security

The document explains the CIA triad in network security, which consists of Confidentiality, Integrity, and Availability, and outlines techniques to achieve each objective. It also compares various encryption methods, including stream vs. block ciphers, symmetric vs. asymmetric encryption, and substitution vs. transposition ciphers. Additionally, it discusses cryptographic hash functions and their applications in ensuring data integrity and security.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
48 views11 pages

Understanding the CIA Triad in Security

The document explains the CIA triad in network security, which consists of Confidentiality, Integrity, and Availability, and outlines techniques to achieve each objective. It also compares various encryption methods, including stream vs. block ciphers, symmetric vs. asymmetric encryption, and substitution vs. transposition ciphers. Additionally, it discusses cryptographic hash functions and their applications in ensuring data integrity and security.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

1. Explain CIA traid?

When talking about network security, the CIA triad is one of the most important models
which is designed to guide policies for information security within an organization.
CIA stands for :
1. Confidentiality
2. Integrity
3. Availability

These are the objectives that should be kept in mind while securing a network.

[Link]
Confidentiality means that only authorized individuals/systems can view sensitive or
classified information. The data being sent over the network should not be accessed by
unauthorized individuals. The attacker may try to capture the data using different tools
available on the Internet and gain access to your information. A primary way to avoid this is
to use encryption techniques to safeguard your data so that even if the attacker gains access
to your data, he/she will not be able to decrypt it. Encryption standards
include AES(Advanced Encryption Standard) and DES (Data Encryption Standard). Another
way to protect your data is through a VPN tunnel. VPN stands for Virtual Private Network and
helps the data to move securely over the network.
Techniques Used:
Encryption: Converts data into unreadable formats using algorithms (e.g., AES, RSA). o
Access Control: Limits access to data through authentication (e.g., passwords, biometric
authentication).
Data Masking: Hides sensitive data (e.g., showing only the last four digits of a credit card). o
Steganography: Hiding information within images, audio, or video files.
Integrity
The next thing to talk about is integrity. Well, the idea here is to make sure that data has not
been modified. Corruption of data is a failure to maintain data integrity. To check if our data
has been modified or not, we make use of a hash function.
We have two common types: SHA (Secure Hash Algorithm) and MD5(Message Direct 5). Now
MD5 is a 128-bit hash and SHA is a 160-bit hash if we’re using SHA-1. There are also other
SHA methods that we could use like SHA-0, SHA-2, and SHA-3.
Let’s assume Host ‘A’ wants to send data to Host ‘B’ to maintain integrity. A hash function will
run over the data and produce an arbitrary hash value H1 which is then attached to the data.
When Host ‘B’ receives the packet, it runs the same hash function over the data which gives
a hash value of H2. Now, if H1 = H2, this means that the data’s integrity has been maintained
and the contents were not modified.
Techniques Used:
Hashing:Uses cryptographic hash functions (e.g., SHA-256) to verify data integrity.
Checksums: A mathematical value that verifies data has not changed.
Digital Signatures: Confirms the authenticity of data and prevents tampering.
Audit Logs: Tracks changes made to data.

Availability
This means that the network should be readily available to its users. This applies to systems
and to data. To ensure availability, the network administrator should maintain hardware,
make regular upgrades, have a plan for fail-over, and prevent bottlenecks in a network.
Attacks such as DoS or DDoS may render a network unavailable as the resources of the
network get exhausted. The impact may be significant to the companies and users who rely
on the network as a business tool. Thus, proper measures should be taken to prevent such
attacks.
Techniques Used:
Redundancy: Having backup systems (e.g., multiple servers, cloud backups).
Load Balancing: Distributing network traffic across multiple servers.
2. Difference between stream and block.

Stream Cipher
Block Cipher

Block Cipher Converts the plain text into Stream Cipher Converts the plain
cipher text by taking plain text’s block at text into cipher text by taking 1 bit
a time. plain text at a time.

Block cipher uses either 64 bits or more While stream cipher uses 8 bits.
than 64 bits.

While stream cipher is more


The complexity of block cipher is simple. complex.

Block cipher uses confusion as well as While stream cipher uses only
diffusion. confusion.

In block cipher, reverse encrypted text is While in-stream cipher, reverse


hard. encrypted text is easy.

The algorithm modes which are


The algorithm modes which are used in used in stream cipher are CFB
block cipher are ECB (Electronic Code (Cipher Feedback) and OFB (Output
Book) and CBC (Cipher Block Chaining). Feedback).

Block cipher works on transposition While stream cipher works on


techniques like rail-fence substitution techniques like Caesar
technique, columnar transposition cipher, polygram substitution cipher,
technique, etc. etc.

Block cipher is slow as compared to a While stream cipher is fast in


stream cipher. comparison to block cipher.

Suitable for applications that require


Suitable for applications that require strong encryption, such as file
strong encryption, such as file storage storage and internet
and internet communications. communications.
Stream Cipher
Block Cipher

More secure than stream ciphers when Less secure than block ciphers when
the same key is used multiple times. the same key is used multiple times.

key length is typically 128 or 256


key length is typically 128 or 256 bits. bits.

Operates on fixed-length blocks of data. Encrypts data one bit at a time.

3. Diff between symmentric and unsymmetric.

Symmetric Key Encryption Asymmetric Key Encryption

It requires two keys, a public key and a


It only requires a single key for both
private key, one to encrypt and the other
encryption and decryption.
to decrypt.

The size of ciphertext is the same or smaller The size of ciphertext is the same or larger
than the original plaintext. than the original plaintext.

The encryption process is very fast. The encryption process is slow.

It is used when a large amount of data


It is used to transfer small amount of data.
needs to be transferred.

It provides confidentiality, authenticity,


It only provides confidentiality.
and non-repudiation.

The length of key used is 128 or 256 bits The length of key used is 2048 or higher
Symmetric Key Encryption Asymmetric Key Encryption

In symmetric key encryption, resource


In asymmetric key encryption, resource
utilization is low compared to asymmetric
utilization is high.
key encryption.

It is efficient as it is used for handling large It is comparatively less efficient as it can


amount of data. handle a small amount of data.

Security is higher as two keys are used,


Security is lower as only one key is used for
one for encryption and the other for
both encryption and decryption purposes.
decryption.

The Mathematical Representation is as


The Mathematical Representation is as
follows-
follows-
P = D(Kd, E (Ke,P))
P = D (K, E(K, P))
where Ke –> encryption key
where K –> encryption and decryption key
Kd –> decryption key
P –> plain text
D –> Decryption
D –> Decryption
E(Ke, P) –> Encryption of plain text using
E(K, P) –> Encryption of plain text using K
encryption key Ke. P –> plain text

Examples: Diffie-Hellman, ECC, El Gamal,


Examples: 3DES, AES, DES and RC4
DSA and RSA
[Link] Between Substitution Cipher Technique and Transposition Cipher
Technique

Substitution Cipher Technique Transposition Cipher Technique

In substitution Cipher Technique, plain text In transposition Cipher Technique, plain


characters are replaced with other text characters are rearranged with
characters, numbers and symbols. respect to the position.

Substitution Cipher’s forms are: Mono Transposition Cipher’s forms are: Key-
alphabetic substitution cipher and poly less transposition cipher and keyed
alphabetic substitution cipher. transposition cipher.

In substitution Cipher Technique, character’s While in transposition Cipher Technique,


identity is changed while its position remains The position of the character is changed
unchanged. but character’s identity is not changed.

While in transposition Cipher Technique,


In substitution Cipher Technique, The letter
The Keys which are nearer to correct key
with low frequency can detect plain text.
can disclose plain text.

The example of substitution Cipher is Caesar The example of transposition Cipher is


Cipher, monoalphabetic cipher, and Rail Fence Cipher, columnar transposition
polyalphabetic cipher. cipher, and route cipher.

Involves replacing plaintext letters or groups


Involves rearranging the order of the
of letters with ciphertext letters or groups of
plaintext letters or groups of letters
letters according to a specific algorithm or
according to a specific algorithm or key.
key.

The frequency distribution of the plaintext The frequency distribution of the


letters is typically obscured, but patterns can plaintext letters remains the same, but
still be detected with statistical analysis. the order is scrambled, making it difficult
Substitution Cipher Technique Transposition Cipher Technique

to detect patterns with statistical


analysis.

Vulnerable to frequency analysis attacks, Less vulnerable to frequency analysis


where the most commonly used letters or attacks, but still susceptible to attacks
letter combinations in the language can be such as brute force and known plaintext
identified and used to deduce the key. attacks.

Relatively easy to understand and Can be more difficult to implement and


implement, making it suitable for simple understand, but can be more secure than
applications. substitution ciphers for certain
applications.

[Link] Between Confusion and Diffusion

Confusion Diffusion

Confusion is a cryptographic technique Diffusion is used to create cryptic plain


that is used to create faint cipher texts. texts.

Confusion is possible through substitution Diffusion is possible through transposition


algorithms. algorithms.

In confusion, if one bit within the secret is In diffusion, if one image within the plain
modified, most or all bits within the text is modified, many or all image within
cipher text also will be modified. the cipher text also will be modified
Confusion Diffusion

In confusion, vagueness is increased in In diffusion, redundancy is increased in the


resultant. resultant.

Both stream cipher and block cipher use


Only block cipher use diffusion.
confusion.

The relation between the cipher text and The relation between the cipher text and
the key is masked by confusion. the plain text is masked by diffusion.

[Link] Between AES and DES


AES and DES are two widely used encryption algorithms, but they differ significantly in terms
of key length, block size, and security. While DES has become outdated due to its shorter key
length, AES remains a standard for secure encryption.

DES
[Link] AES

AES stands for Advanced DES stands for Data


Encryption Standard Encryption Standard
1.

The date of creation is 2001. The date of creation is 1977.


2.

Byte-Oriented. Bit-Oriented.
3.

Key length can be 128-bits, 192- The key length is 56 bits in


bits, and 256-bits. DES.
4.

Number of rounds depends on DES involves 16 rounds of


key length: 10(128-bits), 12(192- identical operations
5. bits), or 14(256-bits)
DES
[Link] AES

The structure is based on a The structure is based on


substitution-permutation a Feistel network.
6. network.

The design rationale for AES is The design rationale for DES
open. is closed.
7.

The selection process for this is The selection process for this
secret but accepted for open is secret.
8. public comment.

DES can be broken easily as


AES is more secure than the DES it has known vulnerabilities.
cipher and is the de facto world 3DES(Triple DES) is a
standard. variation of DES which is
secure than the usual DES.
9.

The rounds in DES are:


The rounds in AES are: Byte Expansion, XOR operation
Substitution, Shift Row, Mix with round key, Substitution
Column and Key Addition and Permutation
10.

AES can encrypt 128 bits of DES can encrypt 64 bits of


plaintext. plaintext.
11.

It can generate Ciphertext of 128, It generates Ciphertext of 64


192, 256 bits. bits.
12.

AES cipher is derived from an DES cipher is derived from


aside-channel square cipher. Lucifer cipher.
13.

AES was designed by Vincent DES was designed by IBM.


14. Rijmen and Joan Daemen.

No known crypt-analytical Known attacks against DES


15. attacks against AES but side include Brute-force, Linear
DES
[Link] AES

channel attacks against AES crypt-analysis, and


implementations possible. Differential crypt-analysis.
Biclique attacks have better
complexity than brute force but
still ineffective.

It is faster than DES. It is slower than AES.


16.

It is flexible. It is not flexible.


17.

It is efficient with both hardware It is efficient only with


and software. hardware.
18.

7. Hash cryptography function

Hash functions in cryptography are extremely valuable and are found in practically every
information security application. A hash function transforms one numerical input value into
another compressed numerical value. It is also a process that turns plaintext data of any size
into a unique ciphertext of a predetermined length.
What is Cryptography Hash Function?
A cryptographic hash function (CHF) is an equation that is widely used to verify the validity of
data. It has many applications, particularly in information security (e.g. user authentication).
A CHF translates data of various lengths of the message into a fixed-size numerical string the
hash. A cryptographic hash function is a single-directional work, making it extremely difficult
to reverse to recreate the information used to make it.
How Does a Cryptography Hash Function Work?
• The hash function accepts data of a fixed length. The data block size varies between
algorithms.
• If the blocks are too small, padding may be used to fill the space. However, regardless of the
kind of hashing used, the output, or hash value, always has the same set length.
• The hash function is then applied as many times as the number of data blocks.
What Does a Cryptography Hash Function Do?
A hash function in cryptography takes a plaintext input and produces a hashed value output
of a particular size that cannot be reversed. However, from a high-level viewpoint, they do
more.
• Secure against unauthorized alterations: It assists you in even minor changes to a message
that will result in the generation of a whole new hash value.
• Protect passwords and operate at various speeds: Many websites allow you to save your
passwords so that you don't have to remember them each time you log in. However, keeping
plaintext passwords on a public-facing server is risky since it exposes the information to
thieves. Websites commonly use hash passwords to create hash values, which they then
store.
Applications of Cryptographic Hash Functions
Below are some applications of cryptography hash functions
Message Authentication
• Message authentication is a system or service that verifies the integrity of a communication.
• It ensures data is received precisely as transmitted, with no modifications, insertions, or
deletions, a hash function is used for message authentication, and the value is sometimes
referred to as a message digest.
• Message authentication often involves employing a message authentication code (MAC).
• MACs are widely used between two parties that share a secret key for authentication
purposes. A MAC function uses a secret key and data block to generate a hash value, that
identifies the protected communication.
Data Integrity Check
• Hash functions are most commonly used to create checksums for data files.
• This program offers the user with assurance that the data is correct.
• The integrity check allows the user to detect any modifications to the original file.
• It does not assure uniqueness. Instead of altering file data, the attacker can update the entire
file, compute a new hash, and deliver it to the recipient.
Digital Signatures
• The digital signature application is comparable to message authentication.
• Digital signatures operate similarly to MACs.
• Digital signatures encrypt message hash values using a user's private key.
• The digital signature may be verified by anybody who knows the user's public key.

You might also like