Differences

This shows you the differences between two versions of the page.

--- ciphers:gcm [2020/05/26 00:35] – peter
+++ ciphers:gcm [2020/07/15 09:30] (current) – external edit 127.0.0.1
@@ Line 1: / Line 1: @@
 ====== Ciphers - GCM ======
-GCM ([[http://en.wikipedia.org/wiki/Galois/Counter_Mode|Galois Counter Mode]]) is a is a [[https://en.wikipedia.org/wiki/Block_cipher_mode_of_operation|mode of operation]] for symmetric-key cryptographic [[https://en.wikipedia.org/wiki/Block_cipher|block cipher]] widely adopted for its performance.
+**GCM** ([[http://en.wikipedia.org/wiki/Galois/Counter_Mode|Galois Counter Mode]]) is a is a [[https://en.wikipedia.org/wiki/Block_cipher_mode_of_operation|mode of operation]] for symmetric-key cryptographic [[https://en.wikipedia.org/wiki/Block_cipher|block cipher]] widely adopted for its performance.
 The operation is an [[https://en.wikipedia.org/wiki/Authenticated_encryption|authenticated encryption]] algorithm designed to provide both data authenticity (integrity) and confidentiality.
@@ Line 7: / Line 7: @@
 GCM is defined for block ciphers with a block size of 128 bits.
+----
 ===== Pros =====
@@ Line 21: / Line 22: @@
+----
 ===== Cons =====
@@ Line 31: / Line 33: @@
   - The first weakness is that an n-bit tag provides only n − k bits of authentication security when messages are 2 k blocks long.
-    * Competing modes do not have this problem, or have it only when n = 128, in which case the practical effect is minimal.
+    * Competing modes do not have this problem, or have it only when n = 128, in which case the practical effect is minimal.\\ \\
   - A successful forgery immediately reveals information about the authentication key.
     * This weakness exacerbates the consequences of the first one, and leads to a complete loss of authentication security.