Pseudorandom Number Generation for Quantum-Resistant Encryption

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing symmetric encryption methods, such as AES and One Time Pad, face vulnerabilities like susceptibility to auxiliary channel attacks and insufficient resistance against quantum computer brute force, making them impractical for secure data transmission.

Innovation Solution

A computer-implemented method using a pseudorandom number generation process involving a boot value, XOR operation with a nonce, and a one-way hash function to create a sequence of pseudorandom masks for secure encryption and decryption, resistant to auxiliary channel attacks and providing quantum security.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If AES encryption is used, then encryption speed and efficiency are improved, but resistance to quantum computer brute force attacks deteriorates

Engineering Contradiction:

Improveencryption speedVSAvoidresistance to quantum computer brute force attacks

Core Design Contradiction:

ProductivityVSReliability

Solution Approach 1:

The patent changes the key parameter from 256-bit (AES-256) to 512-bit key length, doubling the security level to resist quantum computer brute force attacks while maintaining the same encryption algorithm structure and performance characteristics

Inventive Principle:

Principle #35Parameter changes

2Reliability

If One Time Pad encryption is used, then security level is improved to infinite, but practical implementation deteriorates due to stringent conditions

Engineering Contradiction:

Improvesecurity levelVSAvoidpractical implementation

Core Design Contradiction:

ReliabilityVSEase of operation

Solution Approach 1:

The patent extracts the essential security feature of One Time Pad (unbreakable encryption) while removing the impractical requirement of generating and managing truly random keys of the same length as the message, by using a fixed 512-bit key with iterative hashing to generate encryption rounds

Inventive Principle:

Principle #2Taking out (Extraction)

Solution Approach 2:

The patent segments the encryption process into multiple rounds (at least 10 iterations) where the same 512-bit key is repeatedly hashed and applied, effectively creating a long pseudorandom key stream from a short fixed key, thus achieving OTP-like security without OTP's key management burden

Inventive Principle:

Principle #1Segmentation

3Productivity

If AES-GCM or AES-OCB modes are used for real-time data streams, then encryption efficiency is improved, but security weaknesses are introduced

Engineering Contradiction:

Improveencryption efficiencyVSAvoidsecurity weaknesses

Core Design Contradiction:

ProductivityVSReliability

Solution Approach 1:

The patent uses disposable pseudorandom masks generated through iterative hashing for each encryption operation, where each mask is used once and then discarded, ensuring that even if one mask is compromised, subsequent encryptions remain secure, thus eliminating the cumulative security weaknesses in AES-GCM/OCB

Inventive Principle:

Principle #27Cheap short-living objects (Disposable)

Data Source

PatentUS20250004722A1Method for generating a pseudorandom number and method for symmetrically encrypting a message

Publication Date: 2025.01.02 CYFERALL

AI summary

The invention relates to a computer-implemented method for generating at least one pseudorandom number, comprising: obtaining an initiation value (102), K, with a certain entropy represented by its bit length; executing a one-way hash function (100), H, adapted for a certain bit length, on the starting value and then on the successive values of a series of at least one element, in which the pseudorandom number (104), Mi, is represented by H(Mi−1), with i>0, and M0=K. Other aspects of the invention comprise a method for encrypting a message, a method for encrypting a data flow and a symmetrical encryption method.