Attacking Cryptography Flip coins 64 coin flips Some will be - - PowerPoint PPT Presentation

attacking cryptography flip coins
SMART_READER_LITE
LIVE PREVIEW

Attacking Cryptography Flip coins 64 coin flips Some will be - - PowerPoint PPT Presentation

Attacking Cryptography Flip coins 64 coin flips Some will be assigned to make it up. Others will write a simple program to do it. 010101 string Turn into coin flip channel on Slack. Measuring Randomness One of the


slide-1
SLIDE 1

Attacking Cryptography

slide-2
SLIDE 2

Flip coins

  • 64 coin flips
  • Some will be assigned to make it up.
  • Others will write a simple program to do it.
  • 010101 string
  • Turn into coin flip channel on Slack.
slide-3
SLIDE 3

Measuring Randomness

  • One of the following I made up; the other one I

randomly generated.

  • 001010101011001101
  • 010101101010001001
slide-4
SLIDE 4

Cryptography Model

Plaintext Cyphertext

CRYPTOGRAPHY

slide-5
SLIDE 5

Random Oracle Model

Plaintext RANDOM

slide-6
SLIDE 6

Definitions

  • Hash function
  • Stream cipher
  • Block cipher
  • Symmetric key encryption
  • Public key encryption
  • Digital signature scheme
  • Pseudorandom
slide-7
SLIDE 7

Hash Functions

  • Random function
  • Password storage
  • Checksums on files
  • sys files
  • user files
  • integrity of sys files
  • Message digests h(M)
  • Sign the digest
  • Timestamp the digest
slide-8
SLIDE 8

Properties of Random Functions

  • One way function:
  • Given x, compute h(X). Given h(x) hard to generate the

preimage, x.

  • Output doesn’t leak information about input
  • Given a message x and a key k, compute one-way

encryption h(x,k).

  • Hard to find collisions
  • Hard to find messages x,y such that x≠y but h(x)=h(y).
slide-9
SLIDE 9
  • If |h(m)|=n, then 2

n

hash values. Attacker needs to guess 2

n/2

values before guessing m.

  • Birthday paradox
  • given 30 or more people, some pair will have the same birthday
  • given 23 or more, more 50% odds
  • Capture-recapture
  • k/K = n/N
  • N= Kn/k
  • where k=overlap individuals, K=recapture population,

n=capture population, N=total population

slide-10
SLIDE 10

Public key encryption

  • Trapdoor one way function
  • KR - public key
  • KR-1 - private key
  • Given KR, can’t compute KR-1
  • C={M}KR
  • M = {C}KR-1
slide-11
SLIDE 11

Attacks

  • Known plaintext
  • Chosen plaintext
  • Chosen ciphertext
  • Related key attack
  • Forgery attack
  • Key recovery attack