Cryptology ePrint Archive: Report 2019/1497

Analysis of Modified Shell Sort for Fully Homomorphic Encryption

Joon-Woo Lee and Young-Sik Kim and Jong-Seon No

Abstract: The Shell sort algorithm is one of the most practically effective 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 FHE data, we modify the Shell sort with an additional parameter $\alpha$ and a gap sequence of powers of two. The modified Shell sort 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 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. Further, the performance of the modified Shell sort is numerically compared with the case of Ciura's optimal gap sequence and the case of the optimal window length obtained through the convex optimization.

Category / Keywords: applications / Fully Homomorphic Encryption, Sorting Algorithm

Date: received 30 Dec 2019

Contact author: joonwoo3511 at ccl snu ac kr

Available format(s): PDF | BibTeX Citation

Version: 20191230:194233 (All versions of this report)

Short URL: ia.cr/2019/1497


[ Cryptology ePrint archive ]