L03-Cryptanalysis-Overview

L03-Cryptanalysis-Overview - 1 Cryptanalysis Cryptanalysis...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 Cryptanalysis Cryptanalysis – – An overview An overview 2 Unconditional Cryptography Unconditional Cryptography • Cryptographic schemes that are provably 100% secure • An opponent cannot break the scheme: – even if unlimited text is available – even if unlimited time is available – even if unlimited computing power is available • Strength of scheme relies on a mathematical proof that the opponent does not have enough information to break the cryptographic scheme 3 Conditional Cryptography Conditional Cryptography • Cryptographic schemes that are not 100% secure • An opponent can break the scheme: – if unlimited text is available – if unlimited time is available – if unlimited computing power is available • Strength of such a scheme relies on the assumption that the opponent does not have sufficient resources (text, time, computers, money) to break the scheme 4 Kerckhoff Kerckhoff ’ ’ s s Principle Principle • The security of a system should not rely on the obscurity of the encryption/decryption algorithm....
View Full Document

This note was uploaded on 09/15/2010 for the course CSE IT325 taught by Professor Maniklaldas during the Fall '09 term at Punjab Engineering College.

Page1 / 17

L03-Cryptanalysis-Overview - 1 Cryptanalysis Cryptanalysis...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online