The behaviour of the cryptographic primitives in case of large data volumes
Tomoiaga Radu, Mircea Stratulat · 2010
In case of cryptographic algorithms, the benchmark is generally created on input data in small amounts. The computation time is low and for accuracy, the test is repeated several times and the benchmark result is calculated as an average of the obtained times. In the present paper, we shall analyze the performance of the cryptographic algorithms for large data volumes. The large data are saved on external drives (hard disk), and as news, the access time for the information on the hard disk is added to the encrypting time.