RSA is a widely used asymmetric encryption algorithm, whereas AES, DES, and Blowfish are symmetric algorithms.

Hashing is a one-way function that maps data of arbitrary size to a fixed-size value, primarily used for data integrity verification.

In asymmetric (public key) cryptography, data encrypted with a public key can only be decrypted by the corresponding private key.

A secure hash function must be collision-resistant, meaning it should be computationally infeasible to find two different inputs that produce the same hash output.

The challenge with symmetric encryption is securely sharing the secret key between parties, which becomes complex as the number of users increases.

RSA is frequently used for digital signatures, where the sender signs a document with their private key, and the recipient verifies it with the sender's public key.

Salting involves adding random bits to a password before hashing it, ensuring that identical passwords result in different hash outputs, thus mitigating rainbow table attacks.

ECC is an approach to public-key cryptography (asymmetric) based on the algebraic structure of elliptic curves over finite fields.

Hash functions are designed to be irreversible, meaning you cannot reconstruct the original data from the resulting hash value.

Asymmetric (public-key) encryption allows for digital signatures, which provide non-repudiation because the sender's private key is used to sign, ensuring they cannot deny having sent the message.

The avalanche effect is a property where if an input is changed slightly, the output changes significantly, which is a desirable trait in cryptographic hash functions.

Hybrid systems use symmetric encryption for the large data (the message) for speed, and asymmetric encryption to securely transmit the symmetric 'session' key.

Collision resistance implies that it is mathematically extremely difficult to find two distinct inputs (m1, m2) such that Hash(m1) equals Hash(m2).

CFB (Cipher Feedback) mode allows a block cipher to function as a self-synchronizing stream cipher by encrypting the previous ciphertext block.

In ECB mode, because each block is encrypted independently with the same key, identical plaintext blocks result in identical ciphertext blocks, which can leak data patterns.

Diffie-Hellman is a method for securely exchanging cryptographic keys over a public channel, not for encrypting messages themselves.

An IV provides randomness to the encryption process, ensuring that even if the same message is encrypted multiple times with the same key, the resulting ciphertext will be different each time.

Key Escrow involves depositing a copy of a private key with a third party, often to allow for legal recovery or access to encrypted data.

A preimage attack involves attempting to find the original input (or any input) that corresponds to a given hash value, which is effectively trying to reverse the one-way function.