mirror of
https://github.com/calofmijuck/blog.git
synced 2025-12-06 22:53:51 +00:00
[PUBLISHER] upload files #171
* PUSH NOTE : 9. Public Key Encryption.md * PUSH NOTE : 3. Symmetric Key Encryption.md * PUSH ATTACHMENT : is-03-ecb-encryption.png * PUSH ATTACHMENT : is-03-cbc-encryption.png * PUSH ATTACHMENT : is-03-ctr-encryption.png * PUSH NOTE : 07. Public Key Cryptography.md * PUSH NOTE : 7. Key Exchange.md * PUSH NOTE : 03. Symmetric Key Cryptography (2).md * PUSH NOTE : 5. CCA-Security and Authenticated Encryption.md * PUSH NOTE : 6. Hash Functions.md * DELETE FILE : _posts/lecture-notes/internet-security/2023-10-03-key-exchange.md * DELETE FILE : _posts/lecture-notes/modern-cryptography/2023-09-18-symmetric-key-cryptography-2.md * DELETE FILE : assets/img/posts/lecture-notes/modern-cryptography/is-03-cbc-encryption.png * DELETE FILE : assets/img/posts/lecture-notes/modern-cryptography/is-03-ctr-encryption.png * DELETE FILE : assets/img/posts/lecture-notes/modern-cryptography/is-03-ecb-encryption.png
This commit is contained in:
@@ -128,11 +128,11 @@ We learned how to encrypt a single block. How do we encrypt longer messages with
|
||||
|
||||
There are many ways of processing multiple blocks, this is called the **mode of operation**.
|
||||
|
||||
Additional explanation available in [Modes of Operations (Internet Security)](../../internet-security/2023-09-18-symmetric-key-cryptography-2/#modes-of-operations).
|
||||
Additional explanation available in [Modes of Operations (Internet Security)](../internet-security/2023-09-18-symmetric-key-cryptography-2.md#modes-of-operations).
|
||||
|
||||
### Electronic Codebook Mode (ECB)
|
||||
|
||||

|
||||

|
||||
|
||||
- ECB mode encrypts each block with the same key.
|
||||
- Blocks are independent of each other.
|
||||
@@ -140,7 +140,7 @@ Additional explanation available in [Modes of Operations (Internet Security)](..
|
||||
|
||||
### Ciphertext Block Chain Mode (CBC)
|
||||
|
||||

|
||||

|
||||
|
||||
Let $X = \left\lbrace 0, 1 \right\rbrace^n$ and $E : \mathcal{K} \times X \rightarrow X$ be a **PRP**.
|
||||
|
||||
@@ -191,7 +191,7 @@ Note that if $k_1$ is the same as the key used for encrypting messages, then thi
|
||||
|
||||
### Counter Mode (CTR)
|
||||
|
||||

|
||||

|
||||
|
||||
Let $F : \mathcal{K} \times X \rightarrow X$ be a secure **PRF**.
|
||||
|
||||
|
||||
Reference in New Issue
Block a user