STB Lookup Table for RSA Encryption Speed

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Public-key cryptographic systems, such as RSA, are computationally intensive, leading to slow processing speeds, which hinders their efficiency in secure data transmission and encryption.

Innovation Solution

A method is introduced to accelerate the computational speed of computer algorithms, including RSA, by utilizing a data structure called STB (Set of Transformed Bytes) to optimize encryption and decryption processes, allowing for faster data processing without altering the underlying algorithm's functionality.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If public-key cryptographic algorithms (such as RSA) are used for secure data transmission, then security is improved, but computational speed deteriorates

Engineering Contradiction:
ImprovesecurityVSAvoidcomputational speed
Core Design Contradiction:
ReliabilityVSSpeed

Solution Approach 1:

The patent pre-computes and stores lookup tables containing pre-calculated cryptographic values during system initialization. During actual encryption/decryption operations, the system retrieves pre-computed values from these tables rather than performing all calculations in real-time, significantly reducing computational time while maintaining security

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent introduces a lookup table as an intermediary data structure between the input data and the cryptographic computation. This intermediary stores pre-computed transformation values that mediate the encryption/decryption process, allowing fast retrieval without direct complex calculations during data processing

Inventive Principle:
Principle #24Intermediary (Mediator)

2Reliability

If computational complexity is increased to improve security, then security is improved, but processing time deteriorates

Engineering Contradiction:
ImprovesecurityVSAvoidprocessing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system performs complex cryptographic calculations in advance during system setup, storing results in lookup tables. This preliminary action shifts the computational burden from real-time processing to initialization phase, reducing processing time during actual data encryption/decryption while maintaining high security through the pre-computed complex transformations

Inventive Principle:
Principle #10Preliminary action

3Reliability

If standard cryptographic algorithms are used, then security is maintained, but computational efficiency deteriorates

Engineering Contradiction:
ImprovesecurityVSAvoidcomputational efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent creates a copy of the computational workload in the form of lookup tables containing pre-computed transformation values. Instead of executing the full cryptographic algorithm for every data element, the system uses these copied pre-computed values, significantly improving computational efficiency while preserving security through the integrity of the pre-computed transformations

Inventive Principle:
Principle #26Copying

Data Source

PatentUS7664765B2Method for accelerating the computational speed of a computer algorithm
Publication Date: 2010.02.16 CIPHERFLUX
  • US7664765B2 patent drawing
  • US7664765B2 patent drawing
  • US7664765B2 patent drawing

AI summary

A new technique for accelerating the computational speed of a computer algorithm is provided. The inventive technique can be applied to an encryption algorithm, such as an RSA algorithm, for example. A method and system for effecting secure information communications utilizing an accelerated information encryption algorithm is also contemplated.