Improvement of treeless signature schemes implementation by random oracle buffering

This study is devoted to the optimization of implementation of a recent treeless signature scheme called TSS12. It was shown earlier that the most computational complexity of TSS12 signing algorithm is provided by numerous calls to a Gaussian random oracle in undefined number of attempts to find a suitable masking vector. It is shown in this paper that a several hundred byte buffer of pre-generated random data is capable of providing significant acceleration of TSS12 signing algorithm. This fact is believed to be important for digital signature implementation on devices with limited computational capacities, such as wireless sensors.