TREE IT ARCHIVE ARCHIVE

The SecPKI-ServerР’В acts in accordance with these standards. how long they might be regarded as safe). The newsletter also includes a forecast about the assumed validity period of the algorithms and parameters (i.e. Nowadays, the European SOG-IS group of experts publishes the appropriate algorithms and parameters for qualified signatures (according to the eIDAS regulation) in an algorithm newsletter. Before the publication representatives of the industries were consulted. In former times, these algorithms were published once a year by the German Federal Network Agency (Bundesnetzagentur) (based on suggestions of the German Federal Office for Information Security (BSI)) taking into account the technical regulation TR 03125. Instead, for the existing algorithms stronger algorithms and, for example, longer keys are needed. The problem: Timely limited evidential value of digital signaturesР”Р‡or the signature algorithms and keys are used which are РІР‚вЂњ at some point of time РІР‚вЂњ regarded as outdated and no longer suitable.

TREE IT ARCHIVE ARCHIVE

A superordinate signature usually only means the retrieval of a new archive time stamp from a trust center (however, please also see hash tree renewal for a complicated case).

that all used algorithms and their parameters are strong enough at this point of time. It is important, however, that the validity of the signature can be reliably identified at the time of the first superordinate signature, i.e.

when signatures which are already some year old shall be imported into the archive. The first superordinate signatures (the completion of the hash trees with a time stamp) can be created later on, e.g. This superordinate signature is created by using new and valid algorithms as well as qualified time stamps. Therefore, a superordinate signature is required before the expiration of the validity of the existing algorithms. With algorithms which have become invalid it is not possible anymore to find out if the concerned signatures are still valid.

Additionally, it also creates a root hash for all superordinate hash values in the tree even if the number of 1.000 has not been reached yet.Р”Р„fter some time the encryption algorithms become invalid and must be replaced by new ones. If a hash tree shall be completed with a time stamp, the SecPKI-ServerР’В generates in any case a superordinate hash for all hash values which have no superordinate hash yet. This time stamp then secures all hash values of the documents in a hash tree. Only for the so-called root superordinate hash value a time stamp must be requested from the trust center. 1.000) of superordinate hash values has been reached, the hash values are also linked with a superordinate hash value on the next level. The superordinate hash value is representative for all hash values below and is inseparably linked to the them by the calculation of the hash value. 1.000) of new leaves (hash values) has been generated, SecPKIР’В calculates a so-called superordinate hash value which is included above the new leaves in the tree.

Tree it archive