Analysis of Modified Shell Sort for Fully Homomorphic Encryption

Abstract

The Shell sort algorithm is one of the most practically effective in-place sorting algorithms. However, it is difficult to execute this algorithm with its intended running time complexity on data encrypted using fully homomorphic encryption (FHE), because the insertion sort in Shell sort has to be performed by considering the worst-case input data. In this paper, in order for the sorting algorithm to be used on the FHE data, we modify the Shell sort with an additional parameter alpha , allowing exponentially small sorting failure probability. For a gap sequence of powers of two, the modified Shell sort with input array length n is found to have the trade-off between the running time complexity of O(n{3/2}sqrt {alpha +log log n}) and the sorting failure probability of 2{-alpha }. Its running time complexity is close to the intended running time complexity of O(n{3/2}) and the sorting failure probability can be made very low with slightly increased running time. Further, the near-optimal window length of the modified Shell sort is also derived via convex optimization. The proposed analysis of the modified Shell sort is numerically confirmed by using randomly generated arrays. For the practical aspect, our modification can be applied to any gap sequence, and we show that Ciura's gap sequence, which is known to have good practical performance, is also practically effective when our modified Shell sort is applied. We compare our modified Shell sort with other sorting algorithms with the FHE over the torus (TFHE) library, and it is shown that this modified Shell sort has the best performance in running time among in-place sorting algorithms on homomorphic encryption scheme.