摘要:
An input unit inputs encrypted data that elements of a subgroup and expressed in an affine representation. A transforming unit transforms the inputted encrypted data into projective representation data expressed in a projective representation. A plain data calculating unit subjects the projective representation data to a decrypting process previously defined by a cryptosystem, thereby calculating plain data expressed in the projective representation.
摘要:
An encryption processing unit executes an arithmetic operation decided in advance and outputs an arithmetic result as an element on an algebraic torus. A compressing unit outputs, when the arithmetic result is an exceptional point representing an element on the algebraic torus that cannot be compressed by a compression map for compressing an element on the algebraic torus into affine representation, a compression result obtained by compressing the arithmetic result according to the compression map and outputs, when the arithmetic result is the exceptional point, an element belonging to a specific set decided in advance that does not overlap a set to which a compression result obtained by compressing the arithmetic result, which is not the exceptional point, belongs.
摘要:
In a computing device that calculates a square of an element in a finite field, a vector representation of the element in the finite field is accepted. The vector representation includes a plurality of elements. The computing device performs a multiplication operation on a base field using the accepted elements, and obtains a multiplication value. The multiplication operation is determined by a condition under which the element in the finite field is placed in an algebraic torus. The computing device performs an addition and subtraction operation using the obtained multiplication value and the accepted elements, and obtains a calculation result of the square of the element. The addition and subtraction operation is determined by the condition. The computing device then outputs the calculation result.
摘要:
According to one embodiment, a representation converting unit converts a set of n elements (h0, h1, . . . , hn−1) (hi: a member of a finite field Fp̂m, 0≦i≦n−1) that is a projective representation of a member g of an n-th degree algebraic torus Tn(Fp̂m) (n: positive integer, p: prime number, m: positive integer) into a limited projected representation expressed by a set of n elements (h′0, h′1, . . . , h′n−1) (h′i: a member of the finite field Fp̂m, 0≦i≦n−1) in which at least one element out of the n elements is a zero element 0 or an identity element 1. An arithmetic unit omits part of Fp̂m operation that is arithmetic operation in the finite field Fp̂m based on a fact that an element in the set of n elements (h′0, h′1, . . . , h′n−1) represented by the limited projective representation is a zero element “0” or an identity element “1” when performing Fp̂mn operation that is arithmetic operation of a finite field Fp̂mn in combination with the Fp̂m operation.
摘要:
According to one embodiment, a decompressing apparatus includes an input unit, a calculating unit, a first selecting unit, and a decompressing unit. The input unit inputs additional data, which is obtained based on trace expression data in which an element in a subgroup of a multiplicative group of a finite field is trace-expressed and affine expression data in which the trace expression data is affine-expressed, and the trace expression data. The calculating unit calculates a plurality of solutions of simultaneous equations derived by the trace expression data. The first selecting unit selects any of a plurality of items of affine expression data in which the element is affine-expressed based on the additional data, the affine expression data being found from the solutions. The decompressing unit decompresses the selected affine expression data to the element.
摘要:
According to an embodiment, a computing device includes a receiving unit, a calculating unit, a solving unit, a selecting unit, and a determining unit. The receiving unit is configured to receive pieces of input data indicative of elements of a subgroup of a multiplicative group in a finite field and pieces of first additional data for identifying conjugates of the respective pieces of input data. The elements are represented by traces. The calculating unit is configured to calculate a coefficient of an equation based on the pieces of input data. The solving unit is configured to obtain solutions of the equation. The selecting unit is configured to select one of the solutions as a result of computation, based on the first additional data. The determining unit is configured to determine second additional data for identifying a conjugate of the selected result of computation based on the first additional data.
摘要:
A pirate user detecting apparatus includes an extracting unit that extracts, from a digital content, a part or all of a collusion-secure code embedded in correspondence with each of users and that makes it possible to trace pirate users who have made a collusion attack; a calculating unit that calculates a correlation value for each of bits between the part or all of the extracted collusion-secure code and a code assigned to a corresponding one of the users, and calculates a total score of the correlation values for each of the users; a first specifying unit that specifies a threshold value for judging whether each of the users is a pirate user, based on a code length of the extracted collusion-secure code; and a judging unit that judges whether each of the users is a pirate user using the specified threshold value and the calculated total score of each user.
摘要:
An identification information apparatus detects first and second boundary position information representing boundary positions on a high-order bit side and a low-order bit side of codes formed of components, extracts a colluder group matching with a set of the first and second boundary position information among colluder groups including combinations of an arbitrary number of identification information which is not more than a predetermined maximum number, and detects identification information which is common to a plurality of the colluder groups.
摘要:
An identification information apparatus detects first and second boundary position information representing boundary positions on a high-order bit side and a low-order bit side of codes formed of components, extracts a colluder group matching with a set of the first and second boundary position information among colluder groups including combinations of an arbitrary number of identification information which is not more than a predetermined maximum number, and detects identification information which is common to a plurality of the colluder groups.