← Back to Patent Explorer
US7292060B2 Expired / Lapsed US ⏱️ 0.0 years remaining

Logic circuit and method thereof

Assignee: Samsung Electronics Co Ltd
•
Filing: 2005-01-14
•
Granted: 2007-11-06
•
Expires: 2025-01-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An example embodiment of the present invention relates to a method of executing a logic operation while remaining safe from side channel attacks. Another example embodiment of the present invention relates to a logic circuit and device for executing a logic operation while remaining safe from side channel attacks.

Inventors

  • 👤 Elena Trichina
  • 👤 Joong-Chul Yoon

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 22:27
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/002; H04L9/003; A; A61; A61B; A61B18/00; A61B18/18; A61B18/20; A61B18/22; A61B90/00; A61B90/36; A61B2018/225; A61B2018/2253; H04L2209/00; H04L2209/04; H04L2209/046; H04L2209/08; H04L2209/12

Claims Analysis

Total Claims: 37
Claim 1
Independent Claim 82 words
A logic circuit, comprising: a random data generator for generating random data; a random mask device for generating random mask data based on received input data and the random data; and a logic device for executing a Boolean logic operation including the random mask data and outputting the results of the execution in a random mask type, the Boolean logic operation including a first Boolean logic operation not satisfying an associative law and a second Boolean logic operation satisfying an associative law.
Claim 2
Dependent Claim 82 words
A logic circuit, comprising: a random data generator for generating random data; a random mask device for generating random mask data based on received input data and the random data; and a logic device for executing a Boolean logic operation including the random mask data and outputting the results of the execution in a random mask type, the Boolean logic operation including a first Boolean logic operation not satisfying an associative law and a second Boolean logic operation satisfying an associative law.
Claim 3
Dependent Claim 16 words
The logic circuit of claim 1 , wherein the logic device includes a NOT operation device.
Claim 4
Dependent Claim 66 words
The logic circuit of claim 2 , wherein the NOT operation device includes: a NOT logic gate for receiving the random mask data; a first XOR logic gate for receiving first and second random data, the first and second random data being a portion of the generated random data; and a second XOR logic gate for receiving outputs of the NOT and first XOR logic gates.
Claim 5
Dependent Claim 27 words
The logic circuit of claim 3 , wherein the random mask data and the first and second random data each include n-bits, n being a natural number.
Claim 6
Dependent Claim 29 words
The logic circuit of claim 4 , wherein the NOT operation is executed based on corresponding bits of the random mask data and the first and second random data.
Claim 7
Dependent Claim 16 words
The logic circuit of claim 1 , wherein the logic device is an AND operation device.
Claim 8
Dependent Claim 50 words
The logic circuit of claim 1 , wherein the logic device includes a first at least one logic gate for executing a first Boolean logic operation satisfying the associative law and a second at least one logic gate for executing a second Boolean logic operation not satisfying the associative law.
Claim 9
Dependent Claim 204 words
The logic circuit of claim 6 , wherein the AND operation device includes: a first logic gate for receiving first and second random mask data to execute a first AND operation; a second logic gate for receiving the first random mask data and second random data to execute a second AND operation; a third logic gate for receiving the second random mask data and first random data to execute a third AND operation; a fourth logic gate for receiving the first and second random data to execute a fourth AND operation; a fifth logic gate for receiving outputs of the second and third logic gates to execute a first XOR operation; a sixth logic gate for receiving outputs of the fourth and fifth logic gates to execute a second XOR operation; a seventh logic gate for receiving an output of the sixth logic gate and third random data to execute a third XOR operation; and an eighth logic gate for receiving the first and seventh logic gates to execute a fourth XOR operation, the result of the fourth XOR operation being an output of the AND operation device, wherein the first, second and third random data are a portion of the generated random data.
Claim 10
Dependent Claim 59 words
The logic circuit of claim 8 , wherein the first random mask data is the result of a first input data and the first random data being executed with a fifth XOR operation and the second random mask data is the result of a second input data and the second random data being executed with a sixth XOR operation.
Claim 11
Dependent Claim 28 words
The logic circuit of claim 8 , wherein the random mask data and the first, second and third random data each include n-bits, n being a natural number.
Claim 12
Dependent Claim 30 words
The logic circuit of claim 10 , wherein the AND operation is executed based on corresponding bits of the random mask data and the first, second and third random data.
Claim 13
Dependent Claim 16 words
The logic circuit of claim 1 , wherein the logic device is an OR operation device.
Claim 14
Dependent Claim 204 words
The logic device of claim 12 , wherein the OR operation device includes: a first logic gate for receiving first and second random mask data to execute a first OR operation; a second logic gate for receiving the first random mask data and second random data to execute a first AND operation; a third logic gate for receiving the second random mask and first random data to execute a second AND operation; a fourth logic gate for receiving the first and second random data to execute a second OR operation; a fifth logic gate for receiving outputs of the second and third logic gates to execute a first XOR operation; a sixth logic gate for receiving outputs of the fourth and fifth logic gates to execute a second XOR operation; a seventh logic gate for receiving outputs of the sixth logic gate and third random data to execute a third XOR operation; and an eighth logic gate for receiving outputs of the first and seventh logic gates to execute a fourth XOR operation, the result of the fourth XOR operation being an output of the OR operation device, wherein the first, second and third random data are a portion of the generated random data.
Claim 15
Dependent Claim 59 words
The logic circuit of claim 13 , wherein the first random mask data is the result of a first input data and the first random data being executed with a fifth XOR operation and the second random mask data is the result of a second input data and the second random data being executed with a sixth XOR operation.
Claim 16
Dependent Claim 28 words
The logic circuit of claim 14 , wherein the random mask data and the first, second and third random data each include n-bits, n being a natural number.
Claim 17
Dependent Claim 30 words
The logic circuit of claim 15 , wherein the OR operation is executed based on corresponding bits of the random mask data and the first, second and third random data.
Claim 18
Dependent Claim 16 words
The logic circuit of claim 1 , wherein the logic device is a NAND operation device.
Claim 19
Dependent Claim 22 words
The logic circuit of claim 17 , wherein the NAND operation device includes an AND operation device and a NOT operation device.
Claim 20
Dependent Claim 16 words
The logic circuit of claim 1 , wherein the logic device is a NOR operation device.
Claim 21
Dependent Claim 22 words
The logic circuit of claim 16 , wherein the NOR operation device includes an OR operation device and a NOT operation device.
Claim 22
Independent Claim 92 words
A method of executing a Boolean logic operation, comprising: generating random mask data based on received input data and generated random data; executing at least one Boolean logic operation including at least one of the random mask data, the random data and random mask type data, the at least one Boolean logic operation including a first Boolean logic operation satisfying the associative law and a second Boolean logic operation not satisfying the associative law; and outputting the result of the at least one Boolean logic operation applied in a random mask type.
Claim 23
Independent Claim 92 words
A method of executing a Boolean logic operation, comprising: generating random mask data based on received input data and generated random data; executing at least one Boolean logic operation including at least one of the random mask data, the random data and random mask type data, the at least one Boolean logic operation including a first Boolean logic operation satisfying the associative law and a second Boolean logic operation not satisfying the associative law; and outputting the result of the at least one Boolean logic operation applied in a random mask type.
Claim 24
Dependent Claim 19 words
The method of claim 21 , wherein the at least one Boolean logic operation includes a first NOT operation.
Claim 25
Dependent Claim 66 words
The method of claim 22 , wherein the first NOT operation includes: executing a second NOT operation on the random mask data; executing a first XOR operation on received first and second random data, the first and second random data being a portion of the generated random data; and executing a second XOR operation on the outputs of the NOT operation and the first XOR operation.
Claim 26
Dependent Claim 19 words
The method of claim 21 , wherein the at least one Boolean logic operation includes a first AND operation.
Claim 27
Dependent Claim 181 words
The method of claim 24 , wherein the first AND operation includes: receiving first and second random mask data to execute a second AND operation, the first and second random mask data being a portion of the generated random mask data; receiving the first random mask data and second random data to execute a third AND operation; receiving the second random mask data and first random data to execute a fourth AND operation; receiving the first and second random data to execute a fifth AND operation; receiving outputs of the second and third logic gates to execute a first XOR operation; receiving outputs of the fourth and fifth logic gates to execute a second XOR operation; receiving an output of the sixth logic gate and third random data to execute a third XOR operation; and receiving outputs of the first and seventh logic gates to execute a fourth XOR operation, the output of the fourth XOR operation being the result of the first AND operation, wherein the first, second and third random data are a portion of the generated random data.
Claim 28
Dependent Claim 30 words
The method of claim 25 , wherein the first and second random mask data and the first, second and third random data each include n-bits, n being a natural number.
Claim 29
Dependent Claim 33 words
The method of claim 26 , wherein the first AND operation is executed based on corresponding bits of the first and second random mask data and the first, second and third random data.
Claim 30
Dependent Claim 19 words
The method of claim 21 , wherein the at least one Boolean logic operation includes a first OR operation.
Claim 31
Dependent Claim 165 words
The method of claim 28 , wherein the first OR operation includes: receiving first and second random mask data to execute a second OR operation; receiving the first random mask data and second random data to execute a first AND operation; receiving the second random mask data and first random data to execute a second AND operation; receiving the first and second random data to execute a third OR operation; receiving outputs of the second and third logic gates to execute a first XOR operation; receiving outputs of the third and fourth logic gates to execute a second XOR operation; receiving an output of the sixth logic gate and third random data to execute a third XOR operation; and receiving outputs of the first and seventh logic gates to execute a fourth XOR operation, the output of the fourth XOR operation being the result of the first OR operation, wherein the first, second and third random data are a portion of the generated random data.
Claim 32
Dependent Claim 30 words
The method of claim 29 , wherein the first and second random mask data and the first, second and third random data each include n-bits, n being a natural number.
Claim 33
Dependent Claim 33 words
The method of claim 28 , wherein the first OR operation is executed based on corresponding bits of the first and second random mask data and the first, second and third random data.
Claim 34
Dependent Claim 18 words
The method of claim 21 , wherein the at least one Boolean logic operation includes a NAND operation.
Claim 35
Dependent Claim 18 words
The method of claim 32 , wherein the NAND operation includes an AND operation and a NOT operation.
Claim 36
Dependent Claim 18 words
The method of claim 21 , wherein the at least one Boolean logic operation includes a NOR operation.
Claim 37
Dependent Claim 18 words
The method of claim 34 , wherein the NOR operation includes an OR operation and a NOT operation.

References Cited (Backward Citations)

US20010053220A1 Cited
JP2000066585A Cited
US6851052B1 Cited
US6295606B1 Cited
JP2002366029A Cited
US20040215947A1 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2010-11-05 2011-05-07 2011-11-06 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2014-11-05 2015-05-07 2015-11-06 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2018-11-05 2019-05-07 2019-11-06 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag