125 |
=============================== |
=============================== |
126 |
|
|
127 |
This scheme is based on two primitives: 1) A one-time-signature |
This scheme is based on two primitives: 1) A one-time-signature |
128 |
algorithm which takes a random number as its key, and |
algorithm which takes a random number as its private key, and |
129 |
2) a random oracle which generates an apparently random |
2) a random oracle which generates an apparently random |
130 |
bitstring from a given number. |
bitstring from a given number. |
131 |
|
|
146 |
2. Sign the corresponding public keys with `$p$`. This does |
2. Sign the corresponding public keys with `$p$`. This does |
147 |
not present |
not present |
148 |
a problem for the one-time signature algorithm, since |
a problem for the one-time signature algorithm, since |
149 |
the string to be signed is always the same for a given key. |
the random oracle is deterministic and |
150 |
|
the string to be signed is thus always the same for a given `$p$`. |
151 |
|
|
152 |
3. Choose `$x \\in [1,k]$`. The exact algorithm for making this |
3. Choose `$x \\in [1,k]$`. The exact algorithm for making this |
153 |
choice parametrizes the algorithm; possible choices are discussed |
choice parametrizes the algorithm; possible choices are discussed |