diff options
| author | Christian Cleberg <[email protected]> | 2026-06-21 12:42:04 -0500 |
|---|---|---|
| committer | Christian Cleberg <[email protected]> | 2026-06-21 12:42:04 -0500 |
| commit | 538dfa2807ebb82704b2249d337cc9abefde4020 (patch) | |
| tree | 9a465b0dd90150c05d9d4d54297001e6dc7610ed /content/blog/2018-11-28-aes-encryption.org | |
| parent | 54339a23f57c6dd24cc3cec3806d3a29e94b759f (diff) | |
| download | cleberg.net-538dfa2807ebb82704b2249d337cc9abefde4020.tar.gz cleberg.net-538dfa2807ebb82704b2249d337cc9abefde4020.tar.bz2 cleberg.net-538dfa2807ebb82704b2249d337cc9abefde4020.zip | |
fix: resolve spelling issues in pre-2026 posts
Diffstat (limited to 'content/blog/2018-11-28-aes-encryption.org')
| -rw-r--r-- | content/blog/2018-11-28-aes-encryption.org | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/content/blog/2018-11-28-aes-encryption.org b/content/blog/2018-11-28-aes-encryption.org index 03dcd3c..eec087b 100644 --- a/content/blog/2018-11-28-aes-encryption.org +++ b/content/blog/2018-11-28-aes-encryption.org @@ -23,7 +23,7 @@ Though many papers have been published on the cryptanalysis of AES, the fastest single-key attacks on round-reduced AES variants [20, 33] so far are only slightly more powerful than those proposed 10 years ago [23,24]. -- [[http://research.microsoft.com/en-us/projects/cryptanalysis/aesbc.pdf][Bogdonav, et al.]] +- [[http://research.microsoft.com/en-us/projects/cryptanalysis/aesbc.pdf][Bogdanov, et al.]] #+end_quote * How Secure is AES? @@ -42,7 +42,7 @@ Someone may know the method of AES, but without the key, they are powerless. To obscure and spread the data out, AES creates a substitution-permutation network. Wikipedia has a wonderful [[https://upload.wikimedia.org/wikipedia/commons/thumb/c/cd/SubstitutionPermutationNetwork2.png/468px-SubstitutionPermutationNetwork2.png][example of an SP network]] available. This network sends the data through a set of S boxes (using the unique key) to -substitute the bits with another block of bits. Then, a P box will permutate, or +substitute the bits with another block of bits. Then, a P box will permute, or rearrange, the bits. This is performed numerous times, with the last round deriving the key. For AES, the key size specifies the number of transformation rounds: 10, 12, and 14 rounds for 128-bit, 192-bit, and 256-bit keys, @@ -63,7 +63,7 @@ respectively. This process does not necessarily stop after one full round. Steps 2 through 5 will repeat for the number of rounds specified by the key. However, the final round excludes the MixColumns step. As you can see, this is a fairly complex -process. One must have a solid understanding of general mathematic principles to +process. One must have a solid understanding of general mathematical principles to fully understand how the sequence works (and to even attempt to find a weakness). |