Electronic generation device
AssigneeKoninklijke Philips N.V.
InventorsLEANDRO MARIN, ALPHONS ANTONIUS MARIA LAMBERTUS BRUEKERS, PAULUS MATHIAS HUBERTUS MECHTILDUS GORISSEN
Life of this patent
Estimating the term…
Abstract
An electronic generation device (100) arranged to generate parameters for digital obfuscated arithmetic is provided. The generation device includes a prime number unit (110) arranged to generate a prime modulus (p) a base element unit (120) arranged to generate a prime modulus and a base element such that each ring-element modulo the prime modulus may be expressed as a difference between two powers of the potential base element.
Claims14
An electronic generation device arranged to generate parameters for digital obfuscated arithmetic, the parameters defining a commutative ring (n) having a finite number of ring-elements, a base element (u) being comprised in the ring elements, such that each ring-element may be expressed as a difference between two powers of the base element (ua1−ua2) the generation device comprising
- a prime number unit arranged to generate a prime modulus (p) such that
- the prime modulus is less than the square of a desired order (k;
- order(u)=k) of the base element (k2=p), and
- a base element unit arranged to
- select a potential base element (u) larger than one, and smaller than the prime modulus minus one,
- generate different powers of the potential base element (u0, u1, u2, u3, . . . , uk−1),
- determine whether the potential base element (u) has an order equal to the desired order, and if so,
- determine whether each ring-element modulo the prime modulus may be expressed as a difference between two powers of the potential base element.
An electronic generation device as in claim
- an integer unit arranged to
- generate an integer modulus (n) such that the integer modulus is less than the square of the desired order (k;
- order(u)=k) of the base element (k2>n),
- determine that for a divisor of the integer modulus there exists a base element (u′) such that each ring-element modulo the divisor may be expressed as a difference between two powers of the base element (u′), and
- if so, determine whether each ring-element modulo the integer modulus (n) may be expressed as a difference between two powers of the potential base element (u).
An electronic generation method arranged to generate parameters for digital obfuscated arithmetic, the parameters defining a commutative ring having a finite number of ring-elements, a base element (u) being comprised in the ring elements, such that each ring-element may be expressed as a difference between two powers of the base element, the generation method comprising
- generating a prime modulus (p) such that
- the prime modulus is less than the square of a desired order (k;
- order(u)=k) of the base element (k2>p),
- selecting a potential base element (u) larger than one, and smaller than the modulus minus one,
- generating different powers of the potential base element (u0, u1, u2, u3, . . . , uk−1),
- determining whether the potential base element (u) has an order equal to the desired order, and if so,
- determining whether each ring-element may be expressed as a difference between two powers of the potential base element.
Dependencies are inferred from the claim text.