55 |
their operation |
their operation |
56 |
does not |
does not |
57 |
rely on |
rely on |
58 |
|
trapdoor functions, whose strength is based on |
59 |
unproven number-theoretic assumptions such as the |
unproven number-theoretic assumptions such as the |
60 |
difficulty of factoring large integers [XXX]. |
difficulty of factoring large integers [XXX]. |
61 |
|
|
126 |
and then compute a hash tree over the public keys. |
and then compute a hash tree over the public keys. |
127 |
This is only practical for relatively small n. |
This is only practical for relatively small n. |
128 |
|
|
129 |
Yet another approach is to sign a new public key |
Yet another approach is to sign one or more new public keys |
130 |
as the last message signed with the old key. This way, |
as the last message signed with the old key. This way, |
131 |
an arbitrary number of messages can be signed. |
an arbitrary number of messages can be signed. |
132 |
However, verification time increases, and the signer |
However, verification time increases, and the signer |