237 |
& $q$ & $b$ & $th$ & $wh$ & $h$ & $t$ & $?+wh$ & $w$ \\ |
& $q$ & $b$ & $th$ & $wh$ & $h$ & $t$ & $?+wh$ & $w$ \\ |
238 |
\parbox{\sw}{Reyzin one-way\cite{XXX} $(h,b,t,k)$ } |
\parbox{\sw}{Reyzin one-way\cite{XXX} $(h,b,t,k)$ } |
239 |
& $1$ & $b$ & $kh$ & $h$ & $h$ & $t$ & $?$ & $?+k$ \\ |
& $1$ & $b$ & $kh$ & $h$ & $h$ & $t$ & $?$ & $?+k$ \\ |
240 |
|
\parbox{\sw}{Bleichenbacher-Maurer\cite{XXX (ASIACRYPT)} |
241 |
|
(h, } |
242 |
|
& $ |
243 |
\hline |
\hline |
244 |
\multicolumn{4}{l}{\hskip 2cm Derived schemes} \\ |
\multicolumn{4}{l}{\hskip 2cm Derived schemes} \\ |
245 |
\hline |
\hline |
277 |
hash tree as a basis to obtain an basis algorithm |
hash tree as a basis to obtain an basis algorithm |
278 |
with `$q' \ne 1$`. |
with `$q' \ne 1$`. |
279 |
|
|
280 |
|
The values for Bleichenbacher and Maurer's algorithm |
281 |
|
|
282 |
|
|
283 |
- given `$N$` and `$q$`, there are `$q^N$` |
- given `$N$` and `$q$`, there are `$q^N$` |
284 |
possible private keys for signing messages. |
possible private keys for signing messages. |
285 |
|
|