Firmware State Machine Watchpoint Hash Validation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems running firmware or finite state machines are prone to triggering wrong or inconsistent signals, leading to potentially dangerous situations due to anomalous sequences of routines or states, which can result from Single Event Upsets (SEUs) or Multiple Event Upsets (MEUs), especially in critical applications like autonomous vehicles.
Innovation Solution
A method that involves analyzing and decomposing firmware or finite state machines into routines and states, associating watchpoints, calculating and comparing HASH values using a cryptographic HASH function like SHA-256 to validate correct execution paths, thereby preventing unauthorized or incorrect transitions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Extent of automation
If firmware or finite state machine is used to execute tasks in response to internal or external events, then system functionality and automation are improved, but the risk of triggering wrong or inconsistent signals increases, leading to potentially dangerous situations
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing HASH values for all valid execution paths before the firmware or finite state machine runs. This allows the system to have validation criteria ready in advance, enabling rapid detection of anomalous sequences during execution without adding complex real-time validation logic.
Solution Approach 2:
The patent introduces HASH values as an intermediary mechanism to validate execution paths. Instead of directly comparing complex state sequences or instruction streams, the system uses HASH values as a condensed representation that mediates between the execution engine and the validation logic, simplifying the detection of wrong or inconsistent signals.
2Reliability
If care is taken to prevent activation of wrong or inconsistent signals, then system safety is improved, but the complexity of verifying correct working increases
Solution Approach 1:
The patent replaces complex mechanical or logical verification mechanisms with a cryptographic HASH-based validation system. Instead of using complex state comparison or instruction verification logic, the system substitutes these with HASH value calculation and comparison, which is computationally simpler and more efficient while providing equivalent or superior validation capability.
Solution Approach 2:
The patent changes the verification parameter from complex state sequences or instruction streams to condensed HASH values. This parameter transformation maintains the ability to detect wrong or inconsistent signals while dramatically reducing the complexity of the verification process, as HASH values are fixed-length and easily comparable.
3Reliability
If transitions among states or steps of routines are restricted to prevent unauthorized access, then system security is improved, but the flexibility of firmware or finite state machine execution is reduced
Solution Approach 1:
The patent implements feedback by continuously monitoring execution paths and comparing actual HASH values against pre-calculated valid HASH values. This feedback mechanism allows the system to detect and prevent unauthorized transitions or hacking attempts while maintaining normal flexible execution for valid paths, as the validation is transparent and does not interfere with legitimate operations.
Solution Approach 2:
By pre-calculating HASH values for all valid execution paths, the system establishes a comprehensive allowance list before execution begins. This preliminary action enables the system to freely execute any valid path without real-time restrictions while automatically blocking any unauthorized transitions, thus maintaining flexibility for legitimate operations while ensuring security.
Data Source
AI summary
The present disclosure relates to analyzing a firmware or a finite state machine, decomposing the same into a plurality of routines or states, individuating significative instructions or states, associating each significative instruction or state with a watchpoint, calculating first HASH values of the watchpoints using a HASH function before running the firmware or finite state machine for all allowable paths in the firmware or finite state machine corresponding to a correct working of the same, storing the set of first HASH values as calculated, calculating second HASH values of the watchpoints using a HASH function when running of the firmware or finite state machine, comparing the second HASH value of each watchpoint as calculated with the stored set of first HASH values, and validating the instruction or state of a watchpoint as correct if its second HASH value is comprised in the first HASH values of the allowed paths.