Cyber Notes
Cyber Notes
1. Key Distribution:
o One of the biggest challenges is the secure distribution of the secret key. Both
the sender and receiver need to have access to the same key, and ensuring this
without interception can be difficult.
2. Scalability:
o For a network with nn participants, each pair needs a unique key, resulting in
n(n−1)22n(n−1) keys for full connectivity. This becomes impractical as the
number of participants increases.
3. Key Management:
o Keeping track of a large number of keys and ensuring they are regularly
updated and securely stored is complex and challenging, especially in large
organizations.
4. Compromise of One Key Affects All Communication:
o If a key is compromised, all communications encrypted with that key are
vulnerable until a new key is securely distributed and adopted by both parties.
Key Management in Substitution Ciphers
Substitution ciphers are a type of symmetric cipher where each element in the
plaintext is mapped to another element in the ciphertext according to a key.
1. Key Generation:
o A unique key is generated, which defines the substitution scheme
(e.g., a shuffled alphabet). This key must be random and
unpredictable to prevent easy guessing.
2. Key Distribution:
o The generated key must be securely shared between the
communicating parties. This can be achieved through secure
physical transfer, a secure digital channel, or a key exchange
protocol to prevent interception by unauthorized entities.
3. Key Storage and Update:
o Both parties must securely store the key to prevent unauthorized
access. Regularly updating the key helps mitigate the risk of it
being compromised. If a key is suspected to be compromised, a
new key should be distributed immediately.
Effective key management ensures the security and integrity of the substitution
cipher, maintaining confidential communication between parties.
Steganography
Steganography is the practice of hiding messages or information
within other non-secret text or data.
As cryptography, which aims to make a message unreadable by
unauthorized parties through encryption, steganography aims to
conceal the existence of the message.
Block ciphers principle
Block ciphers are fundamental building blocks in cryptography used
to encrypt data in fixed-size blocks. The principles of block ciphers
are essential for ensuring data security and confidentiality.
Here are the core principles:
1. Block Size
The fixed size of the data block that the cipher processes. Larger
block sizes generally provide better security by reducing the risk of
pattern repetition.
2. Key Size
The size of the key used for encryption and decryption. Larger key
sizes provide stronger security but can affect performance due to
increased computational complexity.
3. Substitution and Permutation (SP) Networks
Substitution: This involves replacing bits in the data block with other
bits. Typically implemented using S-boxes (substitution boxes) that
provide non-linearity.
Permutation: This involves rearranging bits within the data block to
achieve diffusion.
4. Confusion and Diffusion
Confusion: Ensures that the relationship between the key and the
ciphertext is as complex as possible. Achieved primarily through
substitution.
Diffusion: Ensures that small changes in the plaintext or key result in
significant changes in the ciphertext. Achieved through permutation
and mixing operations.
5. Rounds
the process of applying a series of transformations to the data block
multiple times.
Each round typically involves a combination of substitution and
permutation operations to progressively increase security.
6. Key Schedule
The process of generating round keys from the main key.
Round keys are derived using various transformations to ensure
that each round uses a unique key, adding to the security.
8. Modes of Operation
ECB (Electronic Codebook): Encrypts each block
independently. Simple but vulnerable to pattern attacks.
CBC (Cipher Block Chaining): Each block is XORed with the
previous ciphertext block before encryption, adding dependency
between blocks.
CFB (Cipher Feedback): Converts a block cipher into a self-
synchronizing stream cipher. Provides error propagation.
OFB (Output Feedback): Converts a block cipher into a
synchronous stream cipher. Does not propagate encryption
errors.
CTR (Counter): Converts a block cipher into a stream cipher
by encrypting a counter value. Allows parallel processing and
random access.
Security Goals
Confidentiality: Ensuring that the data is only accessible to
authorized parties.
Integrity: Ensuring that the data has not been altered in an
unauthorized manner.
Authentication: Verifying the identity of the entities involved in
communication.
Strength Against Attacks
Brute Force Attack: Strength relies on key size. Larger keys
increase resistance.
Cryptanalysis: Resistance to known attacks like linear and
differential cryptanalysis. Well-designed block ciphers use complex
S-boxes and permutation strategies to resist these attacks.
Applications
1. Security: PKC algorithms must be secure against various attacks, including brute
force, mathematical, and cryptographic attacks.
2. Efficiency: PKC algorithms should be computationally efficient to ensure timely
encryption and decryption of messages.
3. Key Management: Effective key management systems are required to generate,
distribute, and protect public and private keys securely.
4. Interoperability: PKC systems should support interoperability between different
platforms and applications to facilitate widespread adoption.
5. Scalability: PKC systems should be scalable to support a large number of users and
transactions without compromising performance or security.
The Diffie-Hellman Key Exchange is a method of securely
exchanging cryptographic keys over a public channel. This
technique allows two parties to generate a shared secret key,
which can be used for encrypted communication, without
having to share any private information during the exchange
The Diffie-Hellman Key Exchange algorithm is a
cryptographic method that allows two parties to securely
generate a shared secret key over an insecure communication
channel. This shared key can then be used for encrypting
further communications. The algorithm relies on the
mathematical difficulty of the discrete logarithm problem,
ensuring that an eavesdropper cannot feasibly determine the
shared secret even if they intercept the public information
exchanged between the two parties.
Message authentication
Messa ge authentication is a critical process in cybersecurity
that ensures the integrity and authenticity of a message. It
involves verifying that the message has not been altered
during transmission and confirming the identity of the sender.
Hash Function
A hash function is a mathematical algorithm that takes an
input (or message) and produces a fixed-size string of bytes.
The output, often called the hash value, appears random and
unique to each unique input.
Properties of Hash Functions:
1. Deterministic: Same input always produces the same
output.
2. Fast Computation: Quick to compute the hash value for
any given input.
3. Preimage Resistance: Difficult to reverse-engineer the
original input from the hash value.
4. Small Changes in Input: Even a slight change in input
drastically changes the output.
5. Collision Resistance: Hard to find two different inputs
that produce the same hash output.
Fulfillment of Requirements:
Data Integrity: Used in digital signatures and MACs to
ensure data has not been altered.
Storage Efficiency: Hash functions are used in databases
and data structures like hash tables to efficiently store
and retrieve data.
Verification: Used in file integrity checks, password
storage (hashed passwords), and verifying data integrity
in transmission.
Fulfilment
The use of MACs and hash functions fulfills critical societal
requirements in various ways:
1. Cybersecurity:
o Protects sensitive information in financial
Make passwords long (at least 12 characters) and use a mix of letters,
numbers, and symbols.
2. Account Lockout
Restrict the number of login attempts in a short period. This can slow
down brute force attacks.
5. Use Captchas
Add CAPTCHAs (those “I’m not a robot” tests) after several failed
login attempts to make sure it’s a person trying to log in, not a bot.
9. Network Security
. Vulnerability Assessments
2. Patch Management
3. Secure Configuration
7. Network Segmentation
9. Continuous Monitoring
Dictionary Attack
Phishing
Keylogging
Social Engineering
1. Financial Gain
o Objective: Steal money or financial information, commit
fraud, or sell stolen data.
o Example: Accessing online banking accounts, credit card
information, or cryptocurrency wallets.
2. Data Theft
o Objective: Steal sensitive or proprietary information such
as personal data, intellectual property, or confidential
business information.
o Example: Gaining access to corporate databases, email
accounts, or personal files.
3. Identity Theft
o Objective: Use stolen credentials to impersonate the
victim and commit fraud or other crimes.
o Example: Opening credit accounts, applying for loans, or
committing crimes under the victim's identity.
4. Espionage
o Objective: Gather intelligence for political, economic, or
competitive advantage.
o Example: Accessing government or corporate secrets,
competitor strategies, or trade secrets.
5. Revenge or Personal Motives
o Objective: Harm or embarrass individuals or
organizations out of spite or personal vendetta.
o Example: Leaking sensitive information, defacing
websites, or sending malicious emails.
Registry Settings for Mobile Devices
Definition
Key Components
Importance
Registry settings allow for fine-tuning of the device to meet specific user
needs or organizational policies.
Key Components
4. Device Authentication
5. Endpoint Security
6. Biometric Authentication
7. Application Whitelisting
Keylogger
Characteristics:
Risks:
Worms
Characteristics:
Risks:
Trojan Horses
Characteristics:
Risks:
Backdoors
Characteristics:
Risks:
1. Electronic Transactions
o Digital Signatures: Recognized as legally binding,
ensuring online contracts and documents are valid.
o Electronic Records: Treated as equivalent to paper
documents, allowing for paperless transactions.
2. Certifying Authorities
o Issuance and Regulation: Certifying authorities issue
digital certificates to verify identities, ensuring trust in
electronic transactions.
o Security Standards: Must follow strict guidelines to
maintain security.
3. Data Protection
o Unauthorized Access: Penalties for hacking and
unauthorized data access protect user data.
o Data Theft: Strict fines and penalties deter data theft and
protect sensitive information.
4. Intermediary Responsibilities
o Content Monitoring: Internet service providers must
monitor and manage content to prevent illegal activities.
o Legal Protection: They are protected from liability if they
follow due diligence in managing content.
5. Government Powers
o Monitoring and Security: The government can monitor
and intercept data to prevent cyber threats and ensure
national security.
o Compliance: Companies must comply with government
requests to aid in cybercrime investigations.
Digital Signature:
Key Points:
Key Points: