Cryptographic Data Size Adjustment Engine for Format-Preserving Encryption

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing cryptographic systems face computational difficulties and data overflows when performing format-preserving operations on large data strings, particularly due to domain size mismatches between data portions, which can exceed the capabilities of standard computing systems and require excessive resources when using BIGNUM libraries.

Innovation Solution

A data processing system with a cryptographic engine and data size adjustment engine that pre-computes constant values to adjust the domain size of pseudorandom outputs, partitioning them into simpler modulo terms and using the Chinese Remainder Theorem to mitigate overflows and ensure proper cryptographic operations without altering the data format.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If modulo operations are performed on large data strings to scale pseudorandom output to match domain size, then format-preserving cryptographic operations can be performed, but data overflows occur that exceed computational capabilities

Engineering Contradiction:
Improvecorrectness of cryptographic outputVSAvoiddata overflows
Core Design Contradiction:
ReliabilityVSObject-affected harmful factors

Solution Approach 1:

The patent divides large data strings into smaller segments that can be processed individually without causing overflows. The modulo operation is applied segment by segment rather than to the entire large data string at once, preventing computational overflow while maintaining the correctness of the cryptographic output.

Inventive Principle:
Principle #1Segmentation

2Reliability

If BIGNUM library is used to represent large data strings, then data overflows are mitigated, but excessive time and processing resources are required

Engineering Contradiction:
Improveprevention of data overflowsVSAvoidcryptographic operation speed
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

Instead of using BIGNUM library operations on entire large data strings, the patent segments the data into smaller portions that fit within standard data type capabilities. This allows using efficient native modulo operations on smaller segments rather than slow BIGNUM operations on large strings, significantly improving cryptographic operation speed.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent changes the parameter size by dividing large data strings into smaller segments. This transformation allows the system to use standard, fast modulo operations on smaller data portions rather than requiring slow BIGNUM library operations on large data, thus improving productivity while maintaining reliability.

Inventive Principle:
Principle #35Parameter changes

3Adaptability or versatility

If domain size of pseudorandom output is scaled to match first string portion, then format-preserving combination operation can be performed, but computational complexity increases due to modulo operations on large data

Engineering Contradiction:
Improvecompatibility of domain sizesVSAvoidcomputational complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent segments large data strings into smaller portions before performing domain size scaling operations. This segmentation reduces the computational complexity of each modulo operation while still achieving the necessary domain size matching for format-preserving combination operations.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary segmentation of data strings before the main cryptographic processing. By dividing the data into manageable segments in advance, the subsequent domain size scaling and modulo operations become computationally simpler and more efficient.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10853502B1Systems and methods for reducing computational difficulty of cryptographic operations
Publication Date: 2020.12.01 MICRO FOCUS LLC
  • US10853502B1 patent drawing
  • US10853502B1 patent drawing
  • US10853502B1 patent drawing

AI summary

Computing equipment may perform format-preserving encryption and decryption by partitioning an input string into first and second portions. The computing equipment may combine the first portion with the second portion after the second portion has been passed through a pseudorandom function using a format-preserving combination operation that requires inputs having a similar domain size. A data size adjustment engine may adjust the domain size of the output of the pseudorandom function to be similar to the domain size of the first string. In order to mitigate undesirable data overflows, the output of the pseudorandom function may be partitioned into a number of computationally simpler terms each having a modulo factor and a pre-computed constant value. The computing equipment may pre-compute the constant values in advance, thereby reducing the computational complexity required for performing the size adjustment operations without generating undesirable data overflows.