| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To realize a (k, n) threshold method for high-speed execution without polynominal interpolation. <P>SOLUTION: The security distribution device uses a (k, n) threshold method of threshold value 2 or higher. A matrix E' in which one row of zero matrix is added to a unit matrix E is circularly shifted. A matrix E ((i-1)(j-1)) of the same size as the unit matrix is acquired from the resultant circularly shift matrix for allocation, resulting in generation of matrix G. Owing to the process in which the generated matrix is used to generate distribution partial data, a distribution process for security information is realized at a very high speed using an exclusive OR. Since a partial matrix G' of the generated matrix G is recursively processed in units of blocks to obtain a restored matrix, a restoring process is more efficiently executed than in the case where an inverse matrix of the partial matrix G' is calculated. <P>COPYRIGHT: (C)2009,JPO&INPIT</p> |
