IP Library Granted Patent US 12,393,738
Granted Patent B2
US 12,393,738 · App. 16/980,471 · Granted Aug 19, 2025

Enhanced circuity security through hidden state transitions

Inventors: Kyle Joseph Juretus (Quakertown, PA); Ioannis Savidis (Wallingford, PA)
Assignee: Drexel University
G06F21/75G06F9/4498G06F21/76G06F21/79
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,393,738
App. No.
16/980,471
Granted
Aug 19, 2025
Kind
B2
Abstract

A state machine system on a chip presents hidden state transitions to create IC knowledge not available in a logical netlist and temporal key dependencies to increase the difficulty of executing the SAT attack. The change in the state space of a circuit over time may be used to increase circuit security. Hidden transitions that are frequency dependent, state dependent keys, and temporally dependent transition keys may be used as ways to increase security against SAT based attacks.

Claims (23)

1. An integrated circuit, comprising:

a finite state machine having functional and obfuscated modes corresponding to the integrated circuit being operable and inoperable; and

a circuit to add hidden state transitions to the finite state machine, wherein the hidden state transitions are based on frequency and coupling capacitance of the integrated circuit,

wherein the finite state machine operates in the obfuscated mode in absence of proper input, and

wherein in response to the proper input, the finite state machine operates in the functional mode using the hidden state transitions not accessible in the absence of the proper input.

2. The integrated circuit of claim 1 , wherein the proper input is a predetermined frequency and a logical sequence.

3. The integrated circuit of claim 1 , wherein the proper input is a predetermined coupling capacitance and a logical sequence.

4. The integrated circuit of claim 1 , wherein the finite state machine comprises multiple states, and transitions between at least two of the multiple states requires the proper input.

5. The integrated circuit of claim 4 , wherein in the obfuscated mode, the finite state machine engages state traps that prevent the transitions between the at least two of the multiple states.

6. The integrated circuit of claim 4 , wherein the proper input includes a predetermined frequency maintained for a predetermined number of cycles.

7. The integrated circuit of claim 4 , wherein the proper input includes a predetermined coupling capacitance.

8. The integrated circuit of claim 4 , wherein the multiple states are re-encoded with a randomly assigned new state bit.

9. The integrated circuit of claim 8 , wherein the re-encoding is done to ensure that there is no imbalance in a switching probability of a newly added register in comparison to original state machine registers.

10. The integrated circuit of claim 1 , wherein the mode is determined in response to a logical signal.

11. A method for securing an integrated circuit, comprising:

providing a finite state machine having functional and obfuscated modes corresponding to the integrated circuit being operable and inoperable; and

adding hidden state transitions to the finite state machine, wherein the hidden state transitions are based on frequency and coupling capacitance of the integrated circuit,

wherein the finite state machine operates in the obfuscated mode in absence of proper input, and

wherein in response to the proper input, the finite state machine operates in the functional mode using the hidden state transitions not accessible in the absence of the proper input.

12. The method of claim 11 , wherein the proper input is a predetermined frequency and a logical sequence.

13. The method of claim 11 , wherein the proper input includes a predetermined coupling capacitance.

14. The method of claim 11 , wherein the finite state machine comprises multiple states, and transitions between at least two of the multiple states requires the proper input.

15. The method of claim 14 , wherein in the obfuscated mode, the finite state machine engages state traps that prevent the transitions between the at least two of the multiple states.

Assignments (4)
CONFIRMATORY LICENSE Recorded Jan 12, 2024
From: DREXEL UNIVERSITY
To: NATIONAL SCIENCE FOUNDATION
Reel/Frame 066295/0729 →
CONFIRMATORY LICENSE Recorded Nov 29, 2022
From: DREXEL UNIVERSITY
To: NATIONAL SCIENCE FOUNDATION
Reel/Frame 062011/0062 →
CONFIRMATORY LICENSE Recorded Nov 9, 2022
From: DREXEL UNIVERSITY
To: NATIONAL SCIENCE FOUNDATION
Reel/Frame 061904/0134 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 20, 2021
From: JURETUS, KYLE JOSEPH; SAVIDIS, IOANNIS
To: DREXEL UNIVERSITY
Reel/Frame 054961/0560 →
Continuity (2)
Provisional Application 62642128 · Mar 13, 2018
Related Publication 20210019449A1 · Jan 21, 2021
References Cited (12)
US 4028647A · Yee · 1977 [cited by applicant]
US 4127825A · Blomley · 1978 [cited by applicant]
US 4926444A · Hamilton · 1990 [cited by examiner]
US 6004027A · Sun · 1999 [cited by applicant]
US 8402401B2 · Chakraborty · 2013 [cited by examiner]
US 20140070854A1 · Kaviani · 2014 [cited by examiner]
US 20170077761A1 · Younis · 2017 [cited by examiner]
US 20170149573A1 · Sadhasivan · 2017 [cited by examiner]
US 20180032723A1 · Danger · 2018 [cited by examiner]
US 20180091318A1 · Sadhasivan · 2018 [cited by examiner]
International Preliminary Report on Patentability for PCT Application No. PCT/US2019/022088 issued Sep. 15, 2020, 6 pages. [cited by applicant]
International Search Report for PCT Application No. PCT/US2019/022088 mailed on May 24, 2019, 2 pages. [cited by applicant]