IP Library › Granted Patent US 12,574,203
Granted Patent B2
US 12,574,203 · App. 18/715,590 · Granted Mar 10, 2026

Secure multi-rail control for sparsely encoded signals

Inventors: Pirmin Robert Vogel (Zurich, CH); Christopher Gori (San Francisco, CA)
Assignee: Google LLC
H04L9/002
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,574,203
App. No.
18/715,590
Granted
Mar 10, 2026
Kind
B2
Abstract

Techniques, apparatuses, and systems for secure multi-rail control for sparsely encoded signals are disclosed. Integrated circuits (ICs) may transmit various signals to manage interactions between circuit components of the IC. These critical signals are common targets for malicious attacks because, when altered, they can cause the IC to perform differently than is intended, and in some cases, bypass security measures. While various strategies may be used to protect against these attacks, modern circuit synthesis tools may optimize away these security measures, leaving the IC vulnerable to manipulation. In contrast, the secure multi-rail control for sparsely encoded signals described herein utilizes multiple rails to transmit sparsely encoded critical signals. Each rail may be controlled by a separate finite state machine (FSM) to reduce vulnerabilities that may arise due to circuit synthesis, provide an adjustable solution that may be leveraged differently based on implementation, and provide comportability to different ICs.

Claims (39)

1 . An integrated circuit comprising:

a first component comprising a first plurality of finite state machines (FSMs);

a second component; and

a plurality of separate data lines configured to communicate, between the first component and the second component, a sparsely encoded signal having a predetermined minimum Hamming distance, each FSM of the first plurality of FSMs being communicatively coupled to the second component through a respective data line of the plurality of separate data lines, each of the plurality of separate data lines configured to communicate a single bit of the sparsely encoded signal, the plurality of separate data lines comprising at least one positive data line and at least one negated data line that is configured to carry a second signal that is different than a first signal carried by the at least one positive data line.

2 . The integrated circuit of claim 1 , wherein:

the second component comprises a second plurality of FSMs;

wherein each FSM of the first plurality of FSMs is communicatively coupled to a respective FSM of the second plurality of FSMs through the respective data line of the plurality of separate data lines.

3 . The integrated circuit of claim 2 , wherein the sparsely encoded signal is indicative of a handshake between the first component and the second component.

4 . The integrated circuit of claim 1 , wherein:

one or more FSMs of the first plurality of the FSMs is communicatively coupled to the second component through a respective negated data line of the at least one negated data line; and

the respective negated data line or the one or more FSMs of the first plurality of FSMs includes an inversion circuit configured to invert an output of a single bit of the sparsely encoded signal, the single bit to be communicated using the respective negated data line.

5 . The integrated circuit of claim 1 , wherein:

the at least one positive data line comprises logic that causes the first signal to perform a positive circuit operation; and

the at least one negated data line comprises logic that causes the second signal to perform a negated circuit operation.

6 . The integrated circuit of claim 1 , wherein the plurality of separate data lines comprises a number of data lines that is the same as the minimum Hamming distance of the sparsely encoded signal.

7 . The integrated circuit of claim 1 , further comprising a cryptographic intellectual property block that includes the first component, the second component, and the plurality of separate data lines.

8 . The integrated circuit of claim 1 , further comprising:

a check module coupled to the plurality of separate data lines, the check module configured to determine a validity of the sparsely encoded signal communicated using the plurality of separate data lines.

9 . The integrated circuit of claim 8 , wherein the check module is configured to:

store a predefined set of valid states;

compare the predefined set of valid states and the sparsely encoded signal communicated using the plurality of separate data lines; and

determine whether the sparsely encoded signal matches any one valid state of the predefined set of valid states based on the comparison between the predefined set of valid states and the sparsely encoded signal.

10 . The integrated circuit of claim 9 , wherein the check module is configured to report an error in response to the determination that the sparsely encoded signal does not match any one valid state of the predefined set of valid states.

11 . The integrated circuit of claim 10 , wherein the check module is further configured to, in response to the determination that the sparsely encoded signal does not match any one valid state of the predefined set of valid states, place at least one of the first component or the second component into a secure state.

12 . The integrated circuit of claim 11 , wherein the secure state comprises a locked state or a reset state.

13 . The integrated circuit of claim 10 , wherein the check module is further configured to cause an output of a process performed by the first component and the second component to be discarded upon completion of the process or after a predetermined period of time has passed after the completion of the process.

14 . The integrated circuit of claim 9 , wherein the predefined set of valid states includes a high state and a low state.

15 . The integrated circuit of claim 8 , wherein the check module is further configured to combine a plurality of signals received from the plurality of separate data lines into a single signal.

16 . The integrated circuit of claim 1 , wherein:

the second component comprises a multiplexer device; and

the sparsely encoded signal is indicative of a multiplexer selector control signal between the first component and the second component.

17 . The integrated circuit of claim 1 , wherein:

the second component comprises a storage register or a configurations and settings register; and

the sparsely encoded signal is indicative of at least one of:

a register setting configured by the first component; or

a write enabled control signal between the first component and the second component.

18 . The integrated circuit of claim 1 , wherein the sparsely encoded signal includes signaling having a set of encoded values with non-adjacent codewords or a Hamming distance of at least two.

19 . The integrated circuit of claim 1 , wherein the first plurality of FSMs includes a plurality of identical FSMs.

20 . The integrated circuit of claim 1 , wherein each valid state of the sparsely encoded signal comprises at least one first bit having a high value and at least one second bit having a low value.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 14, 2024
From: VOGEL, PIRMIN ROBERT; GORI, CHRISTOPHER
To: GOOGLE LLC
Reel/Frame 067735/0203 →
Continuity (2)
Provisional Application 63285965 · Dec 3, 2021
Related Publication 20250150096A1 · May 8, 2025
References Cited (65)
US 7412475B1 · Govindarajalu · 2008 [cited by applicant]
US 8718184B1 · Cronie · 2014 [cited by examiner]
US 8989317B1 · Holden · 2015 [cited by examiner]
US 9152512B2 · Cronin et al. · 2015 [cited by applicant]
US 9183085B1 · Northcott · 2015 [cited by applicant]
US 10691534B2 · Hsiao et al. · 2020 [cited by applicant]
US 10908987B1 · Pandey et al. · 2021 [cited by applicant]
US 12339959B2 · Vogel · 2025 [cited by examiner]
US 20020053062A1 · Szymanski · 2002 [cited by examiner]
US 20050076266A1 · Costin · 2005 [cited by applicant]
US 20070055868A1 · Brier et al. · 2007 [cited by applicant]
US 20110302478A1 · Cronie · 2011 [cited by examiner]
US 20120151159A1 · Muralimanohar et al. · 2012 [cited by applicant]
US 20120213299A1 · Cronie · 2012 [cited by examiner]
US 20160283314A1 · Thanner et al. · 2016 [cited by applicant]
US 20170123896A1 · Baek et al. · 2017 [cited by applicant]
US 20170177259A1 · Motwani · 2017 [cited by applicant]
US 20170308433A1 · Kwon et al. · 2017 [cited by applicant]
US 20190155754A1 · Kida et al. · 2019 [cited by applicant]
US 20200021308A1 · Meier · 2020 [cited by applicant]
US 20200021427A1 · Montoya · 2020 [cited by examiner]
US 20200034528A1 · Yang et al. · 2020 [cited by applicant]
US 20200042465A1 · Duval · 2020 [cited by applicant]
US 20200278937A1 · Durham et al. · 2020 [cited by applicant]
US 20210006353A1 · Hoermaier et al. · 2021 [cited by applicant]
US 20210049309A1 · Su · 2021 [cited by applicant]
US 20210050941A1 · Das et al. · 2021 [cited by applicant]
US 20210089388A1 · Makaram et al. · 2021 [cited by applicant]
US 20210099469A1 · Zeh et al. · 2021 [cited by applicant]
US 20210255942A1 · Jung et al. · 2021 [cited by applicant]
US 20210328761A1 · Guilley · 2021 [cited by examiner]
US 20210365566A1 · Souissi et al. · 2021 [cited by applicant]
US 20220091928A1 · Fernandes et al. · 2022 [cited by applicant]
US 20220391540A1 · Roberts et al. · 2022 [cited by applicant]
US 20230043152A1 · O'Connor · 2023 [cited by examiner]
US 20230177154A1 · Vogel et al. · 2023 [cited by applicant]
CN 111666246 · 2020 [cited by applicant]
CN 111859472 · 2020 [cited by applicant]
EP 3584737 · 2019 [cited by applicant]
JP S54102839A · 1979 [cited by applicant]
JP 2003506750A · 2003 [cited by applicant]
JP 2015216469A · 2015 [cited by applicant]
JP 2016100725A · 2016 [cited by applicant]
JP 2019205015A · 2019 [cited by applicant]
WO 2018034682A1 · 2018 [cited by applicant]
WO 2020211070A1 · 2020 [cited by applicant]
WO 2022217260 · 2022 [cited by applicant]
WO 2023102532 · 2023 [cited by applicant]
“International Preliminary Report on Patentability”, Application No. PCT/US2022/080827, May 2, 2024, 7 pages. [cited by applicant]
“Foreign Office Action”, JP Application No. 2023-557177, Oct. 8, 2024, 24 pages. [cited by applicant]
“Non-Final Office Action”, U.S. Appl. No. 18/061,307, filed Sep. 20, 2024, 18 pages. [cited by applicant]
“Foreign Office Action”, JP Application No. 2023-557177, Apr. 22, 2025, 4 pages. [cited by applicant]
“Foreign Office Action”, IN Application No. 202347059609, Apr. 23, 2025, 6 pages. [cited by applicant]
“Foreign Office Action”, JP Application No. 2024-532818, Jun. 2, 2025, 7 pages. [cited by applicant]
“Notice of Allowance”, U.S. Appl. No. 18/061,307, Mar. 12, 2025, 8 pages. [cited by applicant]
“Final Office Action”, U.S. Appl. No. 17/338,329, Mar. 1, 2024, 17 pages. [cited by applicant]
“Foreign Office Action”, TW Application No. 111113366, Oct. 3, 2022, 11 pages. [cited by applicant]
“International Preliminary Report on Patentability”, Application No. PCT/US2022/071604, Oct. 10, 2023, 8 pages. [cited by applicant]
“International Search Report and Written Opinion”, Application No. PCT/US2022/080827, Apr. 12, 2023, 11 pages. [cited by applicant]
“International Search Report and Written Opinion”, Application No. PCT/US2022/071604, Jul. 21, 2022, 11 pages. [cited by applicant]
“Method of Combinational Circuits Testing by Dividing its Outputs into Groups and Using Codes, that Effectively Detect Double Errors”, Sep. 29, 2017, 8 pages. [cited by applicant]
“Non-Final Office Action”, U.S. Appl. No. 17/338,329, Aug. 16, 2023, 11 pages. [cited by applicant]
“Foreign Office Action”, EP Application No. 22847213.0, Apr. 23, 2025, 5 pages. [cited by applicant]
“Non-Final Office Action”, U.S. Appl. No. 18/552,602, Aug. 6, 2025, 27 pages. [cited by applicant]
“Foreign Office Action”, KR Application No. 10-2024-7018977, Dec. 22, 2025, 7 pages. [cited by applicant]