Exercise 1: Task 7

Xelord
Sonntagsinformatiker
Sonntagsinformatiker
Beiträge: 225
Registriert: 23. Okt 2004 09:49

Exercise 1: Task 7

Beitrag von Xelord » 9. Feb 2009 15:35

In the solution is the size of the private key with \(2^{20} \cdot 2 \cdot 160^2\) denoted. Is this correct ?
In my documents i have the formula \(2^{H} \cdot n^2\), so what does the two mean ?

Benutzeravatar
Patr0rc
Sonntagsinformatiker
Sonntagsinformatiker
Beiträge: 260
Registriert: 8. Feb 2008 11:43

Re: Exercise 1: Task 7

Beitrag von Patr0rc » 10. Feb 2009 15:56

The \(2n^2\) is the right size for one OTS secret key I think. (So \(2^H (2n^2)\) is correct at all - like the solution says.)
Getting to the example (discussed one lecture before your mentioned notes) may solve your problem:
Having the
1st bit being "0" you have (0,1,1), being "1" you have (1,0,0),
2nd bit being "0" you have (1,1,1), being "1" you have (1,0,0), and
3rd bit being "0" you have (1,0,1), being "1" you have (0,1,1).
So for each bit you have to store 2 possible "vectors" of size n which for n bits gets you \(2n^2\).
Does this help you getting it?

Xelord
Sonntagsinformatiker
Sonntagsinformatiker
Beiträge: 225
Registriert: 23. Okt 2004 09:49

Re: Exercise 1: Task 7

Beitrag von Xelord » 10. Feb 2009 17:54

Yeah, i get it. Thanks

Antworten

Zurück zu „Archiv“