Encrypted Data Relationship Detection via Bit-Level Analysis

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Enterprises face challenges in determining the security of their encrypted data, as they lack a mechanism to assess the effectiveness of encryption methods, leading to potential breaches and compromised data integrity.

Innovation Solution

A system that identifies relationships in pools of encrypted files by generating a vector table from bit-level analysis, scoring encrypted files based on patterns, and visualizing these relationships in a graph to determine encryption strength, allowing administrators to identify potential security issues without decrypting the data.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If enterprises store data in encrypted formats to ensure security, then data confidentiality is improved, but the ability to assess encryption strength is lost

Engineering Contradiction:
Improvedata confidentialityVSAvoidencryption strength assessment
Core Design Contradiction:
ReliabilityVSMeasurement precision

Solution Approach 1:

The patent introduces an intermediary system that analyzes encrypted files without decrypting them. This intermediary performs bit-level analysis on the encrypted data to extract statistical features and relationships, enabling security assessment while maintaining encryption confidentiality. The system acts as a mediator between the encrypted data and the assessment process, resolving the contradiction by allowing measurement without decryption.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent replaces the traditional mechanical approach of decryption for security assessment with a computational analysis method. Instead of breaking encryption through decryption (mechanical process), the system uses bit-level statistical analysis and pattern recognition (computational process) to evaluate encryption strength, thereby maintaining confidentiality while enabling assessment.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

2Ease of operation

If enterprises assume encrypted data is secure without verification, then operational simplicity is maintained, but security risks increase

Engineering Contradiction:
Improveoperational simplicityVSAvoidsecurity assurance
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

The patent implements a self-service security assessment mechanism where the enterprise's own encrypted files are automatically analyzed by the system. The bit-level analysis and relationship derivation processes are performed autonomously on the encrypted data without requiring external decryption or complex manual verification, enabling enterprises to self-assess their encryption security while maintaining operational simplicity.

Inventive Principle:
Principle #25Self-service

3Measurement precision

If bit-level analysis is performed on encrypted files to assess security, then encryption strength measurement is improved, but computational complexity increases

Engineering Contradiction:
Improveencryption strength measurementVSAvoidcomputational complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent segments the encrypted file into individual bits and analyzes statistical features at the bit level rather than analyzing the entire file as a whole. This segmentation approach breaks down the complex analysis task into manageable units (bit patterns, frequency distributions, relationship metrics), improving measurement precision while making the computational process more tractable through systematic decomposition.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS10817614B2Automatic detection of relatedness in pools of encrypted data
Publication Date: 2020.10.27 MICRO FOCUS LLC
  • US10817614B2 patent drawing
  • US10817614B2 patent drawing
  • US10817614B2 patent drawing

AI summary

A pool of files are analyzed for relationships between the files. At least some of the files in the pool are encrypted files. The relationships are represented by distances between the files plotted on a graph in two or more dimensions. A point on the graph representing a particular file. The graph includes an interactive interface, such that points or clusters of points can be selected for re-analyzing and re-plotting on a refreshed graph for just those selected points or clusters.