06 - Statistical and Introduction Computational Security...

This preview shows pages 1–6. Sign up to view the full content.

Introduction Statistical and Computational Security Cryptography and Protocols Andrei Bulatov

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

View Full Document
Cryptography and Protocols – Statistical Security 5-2 Statistical Security Let X and Y be two distributions over The statistical distance between X and Y , denoted ( X , Y ) is A symmetric encryption scheme is said to be ε -statistically secure, if for any two plaintexts distributions are ε -equivalent 2 1 , P P ) ( ), ( 2 1 P E P E k k | ] Pr[ ] Pr[ | max } 1 , 0 { T T m T - Y X m } 1 , 0 {
Cryptography and Protocols – Computational Security 6-3 Algorithms Algorithm Algorithm performs a sequence of `elementary steps’ that can be: - arithmetic operations - bit operations - Turing machine moves - ………. (but not quantum computing!!) We allow probabilistic algorithms, that is flipping coins is permitted algorithm input output 0001101100111 10100110111

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

View Full Document
Cryptography and Protocols – Computational Security 6-4 Complexity The time complexity of algorithm A is function f(n) that is equal to the number of elementary steps required to process the most difficult input of length n We do not distinguish algorithms of complexity 2n² and 100000n² A computational problem has time complexity at most f(n) if there is an algorithm that solves the problem and has complexity O(f(n)) - problem solvable in linear time: there is an algorithm that on input of length n performs at most Cn steps - problem solvable in quadratic time: there is an algorithm that on input of length n performs at most Cn² steps Polynomial time solvable problems: O(polynomial); P, BPP
Cryptography and Protocols – Computational Security 6-5 Complexity (cntd) Polynomial time solvable problems: There is a polynomial p(n) such that the problem is solvable in time O(p(n)

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/05/2012 for the course CMPT 404 taught by Professor Andreia.bulatov during the Spring '12 term at Simon Fraser.

Page1 / 16

06 - Statistical and Introduction Computational Security...

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

View Full Document
Ask a homework question - tutors are online