2021 Volume 29 Pages 266-274
Several secret sharing schemes with low computational costs have been proposed. XOR-based secret sharing schemes have been reported to be a part of such low-cost schemes. However, no discussion has been provided on the connection between them and the properties of circulant matrices. In this paper, we propose several theorems of circulant matrices to discuss the rank of a matrix and then show that we can discuss XOR-based secret sharing schemes using the properties of circulant matrices. We also present an evaluation of our software implementation.