Post-Quantum Unique Key Per Token System

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current tokenization systems are vulnerable to key compromise and brute force attacks, especially with the advent of quantum computing, which can exponentially increase the efficiency of certain calculations, compromising cryptographic-based tokenization methods.

Innovation Solution

The Post-Quantum Unique Key Per Token (PQUKPT) system generates a unique, instance-specific key for each tokenization instance, providing protection against key compromise and brute force attacks by using a unique key derivation mechanism or random key generation for each token, ensuring that if a key is compromised, only that specific token is affected.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of manufacture

If a single key is used for tokenization, then the system is simple and efficient, but the system becomes vulnerable to key compromise and brute force attacks

Engineering Contradiction:
Improvesystem simplicityVSAvoidsecurity against key compromise
Core Design Contradiction:
Ease of manufactureVSReliability

Solution Approach 1:

The patent divides the single key into multiple unique keys, with each key associated with a specific token or data element. This segmentation ensures that compromise of one key does not affect others, resolving the contradiction between system simplicity and security reliability.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Each key is assigned specific local properties and scope, where keys are unique to specific tokens or data elements. This local quality approach provides targeted security where needed while maintaining overall system efficiency.

Inventive Principle:
Principle #3Local quality

2Productivity

If quantum computing is used to enhance computational power, then processing efficiency improves, but cryptographic security is compromised

Engineering Contradiction:
Improvecomputational efficiencyVSAvoidcryptographic security
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent changes the cryptographic parameters by using unique keys for each token instead of a single shared key. This parameter change makes the system resistant to quantum computing attacks while maintaining computational efficiency for legitimate operations.

Inventive Principle:
Principle #35Parameter changes

3Reliability

If unique keys are generated for each token, then security against key compromise is improved, but system complexity increases

Engineering Contradiction:
Improvesecurity protectionVSAvoidkey management complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The system automatically generates and manages unique keys for each token without requiring manual intervention. This self-service approach handles the complexity of key generation and distribution while maintaining high security standards.

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The patent implements feedback mechanisms where the system tracks and manages key usage, allowing for automatic key rotation and renewal. This feedback loop simplifies key management complexity while maintaining continuous security protection.

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS20240413987A1Post quantum unique key per token system
Publication Date: 2024.12.12 WELLS FARGO BANK NA
  • US20240413987A1 patent drawing
  • US20240413987A1 patent drawing
  • US20240413987A1 patent drawing

AI summary

Various arrangements relate to a method performed by a processor of a computing system. An example method includes tokenizing a first value using a tokenization algorithm to generate a first token. The first value and first key are inputs of the tokenization algorithm. A message is generated. The message includes a first value identifier associated with the first value and a first key generation identifier associated with the generation of the first key. The message is associated with the first token. A second key is generated. A second value is tokenized using a tokenization algorithm to generate a second token. The second value and second key are inputs of the tokenization algorithm.