Cryptography I, Week 1: Stream Ciphers

这里都是记录或paraphrase couresera 上的课程 Cryptography I

(1). Information theoretic security and the one time pad

Ciphers definition:

a cipher defined over (K,M,C) is a pair of “efficient”algorithms (E,D) where
E:K×MC
D:K×CM
s.t mM,kK,D(K,E(K,m))=m

the last equation is called consistency equation and every cipher has to satisfy it in order to be a cipher.

E is often randomized when encrypting messages, E is gonna random bits for itself, and use those random bits to actually encrypt the message.
D is always deterministic


one time pad ( secure cipher )

M=C=K={0,1}k
所有的数据都是 bit sequencep, length of K is as long as the text

这里写图片描述

The figure above shows that the one-time pad is in fact a cipher.

It is difficult to use in practise since it is as long as the message


Perfect secrecy

**Information Theoretic Security ( Shannno 1949 )
Basic idea: CT should reveal no “info” about PT

** definition

k is uniform in K.
The meaning of this definition is that if a attacker get the cypher text c, then he has no idea whether the cypher text come from M0 or M1 because of the same probability.


OTP has perfect secrecy

(OTP: one-time pad)

it is because, for given c and m, there is only one k such that E(m, k)=c. So it has perfect secrecy. p


Shannon proved:
Thm: perfectsecrecy|K||M|
So OTP is the optimal one that has perfect secrecy


(2). Stream ciphers and pseudo random generators

Stream ciphers: making OTP practical

这里写图片描述

decrease the size of key by using pseudo random generator. PRG is a function that maps

G:{0,1}s{0,1}n,ns

{0,1}s is called seed space.

Stream ciphers does not have perfect secrecy since the length of key is less than length of message.

PRG must be unpredictable

这里写图片描述

这里写图片描述

predictable means we can predict the rest of string if we know the first i letters.

The second figure is the definition. Known the first i bits, the probability of predicting the i+1 is more than 1/2 .

Negligible and non-negligible

Have not understood.

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值