Return to Video

02ps-04 Decrpytion In Parallel Solution

  • 0:00 - 0:06
    And the solution is that all of these modes can be decrypted in parallel.
  • 0:06 - 0:09
    Let's look at each one of these modes one at a time.
  • 0:09 - 0:12
    ECB can be decrypted in parallel
  • 0:12 - 0:14
    because for each C-naught that we have
  • 0:14 - 0:17
    we can decrypt it in reverse
  • 0:17 - 0:19
    to end up with our original message.
  • 0:19 - 0:21
    This can be run on one processor,
  • 0:21 - 0:24
    and you do the same thing on this one and for all the other chunks
  • 0:24 - 0:28
    of the message that we have, and all those can be run in parallel.
  • 0:28 - 0:30
    Counter mode is also decryptable in parallel.
  • 0:30 - 0:34
    For counter mode, the important part that we need to calculate
  • 0:34 - 0:37
    is this bit into the XOR, and we know our nonce,
  • 0:37 - 0:39
    and we know our counter advance,
  • 0:39 - 0:41
    so this whole chunk can be calculated at one processor.
  • 0:41 - 0:44
    This whole chunk can be calculated on another processor,
  • 0:44 - 0:48
    and so on, and once we calculate those, we can calculate our XORs
  • 0:48 - 0:52
    to reverse the C1 into the message, and this can also all be done in parallel.
  • 0:52 - 0:55
    For cipher block chaining mode, similar to counter mode,
  • 0:55 - 0:58
    the important part, this input into the xor again,
  • 0:58 - 1:02
    which for the first block we know the initialization vector,
  • 1:02 - 1:04
    so that can be calculated.
  • 1:04 - 1:06
    Independently, we are already given C-naught,
  • 1:06 - 1:11
    which can be processed in parallel to this part.
  • 1:11 - 1:14
    In C-1 we know, and this could be processed in parallel, and again,
  • 1:14 - 1:17
    we can process--calculate this, calculate this,
  • 1:17 - 1:20
    and CBC can be decrypted in parallel.
  • 1:20 - 1:23
    Similar to cipher block chaining mode, the cipher feedback mode
  • 1:23 - 1:26
    is decryptable in parallel.
  • 1:26 - 1:31
    The idea is very similar to the 2 modes we just discussed.
  • 1:31 - 1:34
    We need to calculate the input into the XOR.
  • 1:34 - 1:38
    This entire chain is known in advance.
  • 1:38 - 1:41
    From C-naught we have this entire chain, which is also known in advance,
  • 1:41 -
    and we can calculate all these inputs into the XOR in parallel and decrypt our message.
タイトル:
02ps-04 Decrpytion In Parallel Solution
概説:

dummy description

more » « less
Team:
Udacity
プロジェクト:
CS387 - Applied Cryptography
Duration:
01:48
Amara Bot added a translation

English subtitles

改訂