| 摘要 |
Provided are a universal hash function calculation device, method, and program in which a message register (81) sequentially outputs a message of which the bit number is a prime number and of which the length is such that the smallest primitive root when the bit number is set as the modulo is 2, outputting said message one bit at a time. A cyclic key register (82) cyclically permutates a key having the same number of bits as the message, and sequentially outputs a cyclic key vector obtained as a result of the cyclical permutation. On the basis of the sequentially-output cyclic key vector and a message bit that is sequentially output one bit at a time, a logical product calculation means (83) outputs the cyclic key vector when the message bit is 1, and outputs an all-zero vector having the same bit number as the cyclic key vector when the message bit is 0. A cumulative sum calculation means (84) accumulates calculation results having the same number as the output bit number and calculates the exclusive disjunction. |
