Fundamentals of Achieving Security - PowerPoint PPT Presentation


PPT – Fundamentals of Achieving Security PowerPoint presentation | free to view - id: 8e825-ZDc1Z


The Adobe Flash plugin is needed to view this content

Get the plugin now

View by Category
About This Presentation

Fundamentals of Achieving Security


Probability Theory Success, Failure, (In) Dependence, Distributions ... Theory. Shannon, Bell Labs, 1949. Mathematical Theory of Communication. Communication ... – PowerPoint PPT presentation

Number of Views:23
Avg rating:3.0/5.0
Slides: 17
Provided by: Mou4


Write a Comment
User Comments (0)
Transcript and Presenter's Notes

Title: Fundamentals of Achieving Security

Fundamentals of Achieving Security
  • Karthik, MSyNC Lab

Goals of Security Mechanisms
  • Privacy Secrecy of data
  • Encryption
  • Authentication Validity of entities involved
  • Signatures, Passwords
  • Integrity Validity of data
  • Hash, CRC
  • Non-Repudiation Establishing source of data
  • Undeniable Signatures

Mathematical Ideas
  • Various fields of mathematics are used
  • Probability Theory Success, Failure, (In)
    Dependence, Distributions
  • Information Theory Entropy or Randomness, Ways to
    measure it,
  • Complexity Theory Algorithms, Running time,
    Complexity classes,
  • Number Theory Integers, Primes, Factoring,
  • Abstract Algebra Groups, Fields, Rings,

Shannons Theory
  • Shannon, Bell Labs, 1949
  • Mathematical Theory of Communication
  • Communication Theory of Secrecy Systems
  • Unconditional Security
  • If security is guaranteed even with unbounded
  • Provable Security
  • Prove security to some well studied problem that
    is considered difficult (NP complete).
  • Computational Security
  • The best known attack requires N operations where
    N is very large

Shannons Theory Contd
  • Perfect Secrecy
  • Prefect Secrecy is achieved if
  • i.e. if the probability of plaintext x is the
    same as its a posteriori probability given
    cipher text y
  • Key Equivocation
  • Measure of the information about the key revealed
    by the cipher text
  • Unicity Distance
  • Gives the amount of cipher text needed to reveal
    the key, for a language with redundancy D, the
    unicity distance U is

Basic Operations in Ciphers
  • Substitution
  • Substitute one plain text symbol with an unique
    cipher text letter
  • S-box, Non-Linear Codes
  • Permutation
  • Rearrange the plain text symbols
  • Permutation Functions, MDS Codes
  • Product Cryptosystems
  • Use Substitution and Permutation one after
  • Fiestel Network, All Modern Ciphers

Avalanche Effect
  • This term was first coined by Fiestel to describe
    the result of substitution and permutation on the
    input plain text
  • As the plain text is processed by the cipher the
    each layer amplifies the pattern of 1s, the
    result is an unpredictable AVALANCHE that results
    in an average of half 0s and half 1s in the
  • This makes the output of the cipher appear random
    and hides the distribution of the plain text and
    the Key in relation to the cipher text.

Effect of Compression
  • Compression reduces the redundancy
  • This makes the distribution of the plain texts in
    the source more even. Thus reducing the
    information leaked in each cipher text block is
  • Compression increases H(P) this make guessing the
    key more difficult

Any New Ideas ?
  • Which source coding techniques can be useful in
    providing security

Use of Channel Coding In Cryptography
  • Channel Coding has been used in several different
    scenarios to provide security
  • Examples
  • Encryption
  • McEliese Cipher
  • Secret Error Control Coding
  • Signing
  • Ximmei Scheme
  • Authentication
  • Aumann and Rabin Scheme

Reason for using Channel Codes
  • Usually both security and channel coding is
    needed by applications
  • Wireless applications
  • Channel codes may be good building blocks of
  • Would reduce hardware costs
  • Some similar applications already exist
  • MACS and ECC both detect errors

Usage of Channel Codes in Security machanizms
  • Difficulty in decoding a General Block Code
  • The problem of decoding an arbitrary code is
    considered to be NP hard. This property is used
    as follows
  • Select a good linear code
  • Keep the generator polynomial of the code secret
  • Encode the message to be sent
  • In McEliese System

Other Techniques
  • Burst Error Correction Codes
  • Use in Authentication
  • Signing

Problems In using Channel Codes
  • Adds redundancy
  • Codes vary according to the medium used
  • Simple combinations are not secure

Use of Codes in Current Ciphers
  • Non-linear Codes as S-boxes
  • S-boxes are a very important part of modern block
    and stream ciphers.
  • Provide non-linearity and help defend against
    differential and linear cryptanalysis.
  • Properties needed are Non-linearity, resilience
    and auto-correlation

MDS Codes in Mix-Column of AES
  • The Mix-Column operation of AES (rijndael) has
    been designed based on MDS codes.
  • The security is measured using a term called
    branch number. This is the measure of active
    bytes after each round.

Ideas on Applying Channel codes ?