Cryptographically Secure Shuffle for Cloud Secret Generation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Cloud service providers face challenges in generating cryptographically secure secrets that are difficult to predict, especially when human intervention is inefficient and existing random number generators use deterministic seeds, making generated secrets more predictable for cryptographic functions.

Innovation Solution

A cryptographically secure shuffle technique is employed using multiple layers of secure random number generation to generate secure secrets, involving the creation of source and destination lists, random number generation, and shuffling elements between lists to reduce predictability, with automated regeneration of secrets at fixed intervals.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If deterministic seeds are used in random number generators, then the generation process is efficient and reproducible, but the generated secrets become predictable for cryptographic functions

Engineering Contradiction:
Improvesecret generation efficiencyVSAvoidcryptographic security
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent segments the secret generation process into multiple independent stages, each contributing entropy through separate random number generation operations. Instead of relying on a single deterministic seed, the system divides the process into multiple phases where each phase adds layers of randomness, thereby maintaining efficiency while improving cryptographic security through structured segmentation of the entropy generation process.

Inventive Principle:
Principle #1Segmentation

2Reliability

If multiple layers of secure random number generation are used, then secret predictability is reduced, but the complexity of the generation process increases

Engineering Contradiction:
Improvesecret unpredictabilityVSAvoidshuffle process complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent implements self-service mechanisms where the system automatically manages the multi-layer random number generation process without requiring external intervention. The cryptographically secure shuffle algorithm autonomously performs multiple iterations of randomization, selecting and shuffling array elements through predetermined cryptographic operations, thereby reducing operational complexity while maintaining high unpredictability of the generated secrets.

Inventive Principle:
Principle #25Self-service

3Reliability

If automated regeneration of secrets is implemented at fixed intervals, then security is enhanced against prediction attacks, but the frequency of generation operations increases

Engineering Contradiction:
Improvesecurity against predictionVSAvoidgeneration operation frequency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent implements periodic action by automatically regenerating cryptographic secrets at fixed time intervals or after a predetermined number of operations. This periodic regeneration ensures that even if an attacker observes multiple secrets, the time-bound rotation prevents successful prediction attacks, as each secret is valid only for a specific period. The system balances security enhancement with operational efficiency by using time-based triggers rather than continuous regeneration.

Inventive Principle:
Principle #19Periodic action

Data Source

PatentUS11924340B2Cryptographically secure shuffle with multi-layer randomness
Publication Date: 2024.03.05 ORACLE INT CORP
  • US11924340B2 patent drawing
  • US11924340B2 patent drawing
  • US11924340B2 patent drawing

AI summary

Techniques are disclosed for cryptographically secure shuffling processes for generating and utilizing secrets in an infrastructure-as-a-service (IaaS) environment. In an embodiment, a method comprises generating a source list and a destination list, the source list and destination list association with a sequential format and the source list comprising a plurality of elements in the sequential format; generating a first random number and a second random number; determining a first element in the source list, the first element corresponding to a position in the sequential format of the source list based on the first random number; determining a first destination position in the destination list, the first destination position corresponding to a position in the sequential format of the destination list based on the second random number; and updating the destination list to include the first element in the source list at the first destination position.