Deterministic Tokenization Tables from Seed Expansion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing tokenization systems face challenges in efficiently managing and securely deploying large tokenization tables across various computing devices, leading to slow processing times and increased security risks due to the need for secure transmission and management of these tables.
Innovation Solution
A method for generating tokenization tables locally on computing devices using a smaller seed table, allowing for deterministic expansion to larger sizes, ensuring consistent tokenization across devices without the need for network transmission.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If large tokenization tables are centrally generated and transmitted over the network, then tokenization consistency across devices is achieved, but processing time increases significantly and security risks increase
Solution Approach 1:
The patent divides the large tokenization table into multiple smaller shards or partitions that can be independently generated and distributed. Each computing device receives only the necessary subset of tokenization data, reducing transmission time and processing overhead while maintaining consistent tokenization through coordinated shard distribution
Solution Approach 2:
The patent pre-generates tokenization tables during off-peak hours or in advance before they are needed for actual tokenization operations. The pre-generated tables are then distributed to computing devices ahead of time, eliminating the need for time-consuming generation during critical operations and ensuring consistency across devices
2Ease of manufacture
If large tokenization tables are securely transmitted over the network, then tokenization functionality is deployed, but security risks increase due to potential table acquisition by malicious parties
Solution Approach 1:
The patent segments the tokenization table into multiple smaller shards that are distributed across different locations or computing devices. This segmentation reduces the value of any single intercepted shard to malicious parties, as they would need to acquire and reconstruct multiple shards to compromise the entire system
Solution Approach 2:
The patent introduces an intermediary layer or proxy mechanism between the tokenization table storage and the network. This intermediary can encrypt, obfuscate, or control access to the table data, preventing direct network access and reducing the risk of interception while still allowing authorized computing devices to deploy and use the tables
3Reliability
If encrypted tokenization tables are stored as files and securely managed, then security is improved, but device complexity increases due to decryption and memory management requirements
Solution Approach 1:
The patent divides the encrypted tokenization table into smaller segments or blocks that can be independently managed and decrypted. This segmentation reduces the memory requirements and processing complexity for each device, as they only need to handle and decrypt the specific segments they require rather than the entire large table
Solution Approach 2:
The patent implements self-service mechanisms where computing devices automatically perform decryption, loading, and management of tokenization table segments without requiring complex manual intervention. The system includes automated routines for detecting when tables need to be loaded, decrypting them using stored keys, and managing their lifecycle, thereby reducing operational complexity while maintaining security
Data Source
AI summary
Systems, methods, and apparatuses are described for generating deterministic crypto-random values for cryptographic operations such as tokenization. A computing device may receive a plurality of unique character strings by receiving such strings from a server and/or by generating such strings based on a seed value. The computing device may define a seed table comprising a plurality of rows and a plurality of columns such that each row of the plurality of rows corresponds to a different character of the set of characters and each column of the plurality of columns corresponds to a different character of a unique character string, of the plurality of unique character strings, corresponding to the different character. The table may be expanded by processing sequential rows of the seed table to generate a tokenization table. That tokenization table may be used to generate tokenized versions of input data.