Dynamic 3D Data Storage Against Predictable Cracking

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Traditional encryption methods are inadequate in ensuring data security as they fail to counteract the increasing capabilities of data crackers, necessitating a new approach to enhance data protection.

Innovation Solution

A method for dynamically storing three-dimensional data involves converting files into three-dimensional format, changing storage locations based on a preset movement rule, and restoring them to initial locations, utilizing bionic technology to mimic cellular cytoplasm flow for enhanced security.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional encryption methods are used to protect data, then data security is maintained to some extent, but the increasing cracking capabilities of criminals make these methods inadequate and security is compromised

Engineering Contradiction:
Improvedata securityVSAvoidcracking capability
Core Design Contradiction:
ReliabilityVSObject-affected harmful factors

Solution Approach 1:

The patent transforms traditional two-dimensional data storage into three-dimensional storage by converting files into 3D data structures with spatial coordinates (x, y, z). This dimensional transformation creates a more complex storage architecture that is significantly harder to crack, as attackers would need to navigate and reconstruct the entire 3D spatial structure rather than simply decrypting linear data streams.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

Solution Approach 2:

The patent implements dynamic storage location changes where the position of 3D data in space is not fixed but changes over time according to preset movement rules. This temporal dimension of movement adds another layer of security, as the data location becomes a time-dependent variable that attackers cannot predict or access statically.

Inventive Principle:
Principle #15Dynamics

2Speed

If data is stored in a fixed location for easy access, then retrieval speed is improved, but security is reduced as the location is predictable and easier to target

Engineering Contradiction:
Improvedata retrieval speedVSAvoiddata security
Core Design Contradiction:
SpeedVSReliability

Solution Approach 1:

The patent resolves this contradiction by making the storage location dynamic rather than static. The 3D data position changes according to time-based movement rules, allowing the system to maintain security through unpredictability while still enabling fast retrieval through the use of location mapping algorithms that can quickly calculate current positions based on time and movement patterns.

Inventive Principle:
Principle #15Dynamics

3Reliability

If complex encryption algorithms are applied to enhance security, then data protection is improved, but system complexity and processing overhead increase

Engineering Contradiction:
Improvedata securityVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

Instead of relying solely on complex cryptographic algorithms, the patent introduces a spatial dimension to data storage. The security mechanism is based on the geometric transformation and spatial arrangement of data in 3D space, which provides strong security through structural complexity rather than algorithmic complexity, thereby reducing computational overhead.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

4Reliability

If data is divided into multiple segments for distributed storage, then security and redundancy are improved, but retrieval complexity and time increase

Engineering Contradiction:
Improvedata securityVSAvoidretrieval time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent divides data into multiple segments distributed throughout 3D space, with each segment having specific spatial coordinates. The segmentation is combined with spatial indexing and location mapping that enables efficient retrieval by calculating the positions of all segments and retrieving them in parallel or sequential order based on the 3D spatial structure, rather than searching through unstructured distributed storage.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS12360860B2Three-dimensional data dynamic storage method, storage medium and computer
Publication Date: 2025.07.15 ZHU XIAOJUN
  • US12360860B2 patent drawing
  • US12360860B2 patent drawing
  • US12360860B2 patent drawing

AI summary

The present invention relates to a method for dynamically storing three-dimensional data, a storage medium and a computer. The method for dynamically storing three-dimensional data comprises: converting an original file into a three-dimensional file, storing the three-dimensional file in an initial storage location in three-dimensional space; changing the storage location of the three-dimensional file in three-dimensional space in accordance with a preset movement rule; restoring the three-dimensional file from a current storage location to an initial storage location according to a preset movement rule; restoring the three-dimensional file to an original file. The three-dimensional data of the present invention is stored in a process that enhances the difficulty of cracking by constantly changing the spatial storage location, thereby improving the security of the data.