| 摘要 |
PROBLEM TO BE SOLVED: To provide a secret set calculation technique capable of performing set calculation in a calculation time shorter than before.SOLUTION: Elements of two sets S and T are arranged up and down and sorted. Then, information whether adjacent elements are matched each other or not is utilized to constitute processing for performing set calculation without the use of direct product calculation. Accordingly, only a matrix whose number of lines is O(m+n) is required to be made during calculation, therefore calculation time can be shorter than before. Specifically, set calculation, in secret calculation whose calculation time is O((m+n)log(m+n)), can be achieved. |
