Multivariate Quadratic Chain of Trust for Quantum-Resistant Verification

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing public key infrastructure algorithms are vulnerable to quantum computing, which threatens the security of computing environments, as quantum computers can efficiently solve problems like prime factorization, breaking current cryptographic systems used for secure communications.

Innovation Solution

The implementation of a multivariate quadratic polynomial-based public-key identification scheme to generate private-public key pairs, enhancing the chain of trust between computing components by using a cascading verification method resistant to quantum attacks, ensuring the integrity and authenticity of each component in the system.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional public key infrastructure algorithms are used, then current cryptographic systems can be implemented, but they become vulnerable to quantum computing attacks

Engineering Contradiction:

Improvesecurity of cryptographic systemVSAvoidresistance to quantum computing

Core Design Contradiction:

ReliabilityVSAdaptability or versatility

Solution Approach 1:

The patent changes the mathematical parameters of the cryptographic system by switching from traditional public key algorithms (RSA, ECC) to multivariate quadratic polynomial-based identification schemes. This parameter change makes the system resistant to quantum computing attacks while maintaining cryptographic security, directly resolving the contradiction between current implementability and quantum resistance.

Inventive Principle:

Principle #35Parameter changes

2Reliability

If a chain of trust is established through multiple software layers, then security is enhanced, but the complexity of validation increases

Engineering Contradiction:

Improvesecurity of chain of trustVSAvoidcomplexity of validation process

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the chain of trust validation into discrete, manageable layers where each component (firmware, bootloader, OS, applications) is validated independently using multivariate quadratic identification. This segmentation allows complex multi-layer validation to be broken down into simpler, repeatable units, reducing overall validation complexity while maintaining security.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent introduces multivariate quadratic polynomial-based public key identification as an intermediary mechanism between trust layers. This intermediary provides a standardized, quantum-resistant validation method that simplifies the trust verification process between different software layers, making the overall chain of trust establishment more manageable despite the multiple layers involved.

Inventive Principle:

Principle #24Intermediary (Mediator)

Data Source

PatentUS10484186B2Cascading multivariate quadratic identification schemes for chain of trust

Publication Date: 2019.11.19 INTEL CORP

AI summary

A method, computing system, and computer-readable medium comprising instructions to establish a chain of trust for components of a computing environment. A respective public/private key pair is generated using a multivariate quadratic function F for each component of the computing environment. In response to a challenge from a verifier, a current prover component sends a response that the verifier uses to determine whether to trust the current prover component. The response may include a first commitment value and a second commitment value, which are determined for the current prover component using a public key of a previous prover component. At least one of the first and second commitment values can be determined using a polar function G, which is a polar form of the multivariate quadratic function F.