Common use of Computation Complexity Analysis Clause in Contracts

Computation Complexity Analysis. In computational cost analysis, we consider modular exponential operations as princi- pal factor for calculating our results since other operations such as XOR, multiplication, and addition can be regarded as negligible in comparison with modular exponential operations. Time cost of these operations can be stated as Texp = O(xy mod z). In this section compu- tational cost is represented as Cc. On the other hand, ‘Block Size’ parameter of HF Orderer also affect the performance of the system. For the ‘Block Size’ of B, and the number of GKA participants N, N/B blocks will be processed by the orderer in each parameter distri- bution round. Therefore, the network additionally perform (N/B)Texp modular exponential operations during the following operations.